Status: 4+ years of experience in Investment Banking
Position: SDE 2 equivalent
Location: Pune
Date: August 2021
- Implement 3 stacks using 1 array
- There are 2 binary trees, one very very big and the other very very small. Find if smaller tree exists in bigger tree.
- There is an office, you are given a matrix(nX2 size) having the start and end time of all the individual meetings, find the minimum no. of meeting rooms required to conduct all the meetings.
- There are N rooms each having some number of Keys(1 no. key can only open 1 no. room) in them. Initially you are given one key to a room, find if all the rooms can be opened.
- DSA problem: there is a tree with below properties
-
- each node value = Min(left child value, right child value)
-
- each node will have atmost of 2 children
-
- value of each node is an integer
- Find 2nd most minimum value node in the tree
- Design a music streaming app like YT Music on a high level
- A lot of behavioural + leadership principles questions
- Deep dive into my resume
- Design an API Rate Limiter