First Round (45 mins)

1. Find number N such that all binary representations of 0 to N are substrings of given string s. (Grilled on time complexity).

Second Round (1 hour)

1. Given an array of size “n”. You can perform an “m” operation. In each operation we can either remove an element or we can increase the value of any element by 1. Perform at max “m” operation and return the maximum average.
2. FOLLOW UP : on any element you can perform operation at max “k” times.
3. Given a tree of size “n” and “q” queries. Each node has a value which can be 0 or 1. Each query consists of two - node ”a” and “b”, ”a” will be the ancestor of “b”. Flip the value of all the nodes between the path from “a” to “b”. After the “q” query output value of every node.

Got a reject after 2 rounds.