Round 1
- given n items and k boxes, find number of ways to divide n items into k boxes, no duplicates. e.g. n = 3 and k = 2 ans = 2 [3, 1+2] solved using dp
- Find peak element using binary search
- write sql query given 2 tables (involved minus operation)
- what are some of the performance bottlenecks
Round 2
- Write code to find score of a bowling game, there were multiple conditions like strike, miss, spare etc. Took 1 hour to code and I am a fast coder. Lots of test cases for this one.
Loved both interviewers, very polite and helpful.
Comments (5)


