Google | Coding Round (GOCC) | 14th June 2021

Summary 2 problems, 1 hour Almost all languages allowed Problem 1 You have to perform 3 types of queries on a set of numbers 0 X add a number X 1 X remove the number X (X always exist) 2 X return the number of subsets that sum to X Constraints : 0 <= X <= 103 0 <= number of queries <= 103 Problem 2 You are given N balls and they move either in right or left direction ...