2 Technical Rounds Problem 1 : Given an input n stairs, return the possible permutations to reach nth stair. Constraints: you can move at the most 1 step or two steps at a time. input_1 : n = 0 output_1 : [[0]] input_2 : n = 1 output_2 : [[0,1], [1]] input_3 : n = 2 output_3 : [[0,1,2], [1,2], [0,2], [2]] Design Question : Design an E-commerce website like Amazon/walmart. Problem 2 : Design a stack and implement all the methods in the stack. Problem 3 : Implement queue with stack.

We go through 4 rounds of 1 hour interviews - two interviewers for each round and the final round is a culture fit round. The technical rounds consists of one simple algorithm quesiton and rest are questions about the domain knowledge - in this case java. Respectful and interesting interviewers.