Status: 3.5+ YOE
College: Tier 1 college, 3.5yoe

Round 1: (Online Coding) Merge two sorted LL

Round 2: (Craft Demo)
1. Given a binary tree with unique values, if we delete a node, return the array of root node values of the remaining forest and delete the node.
2. Instead of deletion, replace the value with its rightmost leaf value.

The question was shared with me 3-4 hrs before the interview, I had to prepare working demo for the same. The entire logic and code was throughly been reviewed by the interviewer and tested with multiple test cases. She then also added multiple flavours to the question. (point number 2)

Round 3: (Value Assessor)

1. Same question as above, but now we have BST
2. Find the median of a data stream coming. Can we do it in some limited space, instead of storing all values ??

Was able to provide the solutions for both the problem, was not able to optimize on space for the second question.

Round 4: (Design)
Role -> Operations -> (other operations based on roles)
Accountant - > Access Payslips (View only)
CA -> Access Payslips(View, Edit)

There are roles, roles are associated with operations and operations have different actions with them. We had to design the permission given to a user based on role, then it was extended to be able to handle type of permission, then type of action and so on. I tried to give her a tree type of DS to use where each role has operation and each operation has action linked to it. We can get all the roles having one particular operation etc. But the interviewer was not impressed by the design.

I am not sure I was able to explain the problem correctly but it would be helpful if someone can try out the solution and post in comments. Thanks.

Rejection mail received. There was a bad feedback in the interview process. I was approached again 2-3 weeks after for interviewing with another team and to take all rounds again. I agrred but on the day of the interview, HR called up and said the interviews wont happen and I havent recieved a call yet from them.