Hope this will help someone

Interview Duration : 2 hours

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], [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.