Round 1
Questions:
- Rotten Oranges Variation -> standard BFS question
- House Robber variation -> standard DP question
The candidate was able to solve both in around half an hour.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2
Questions:
- Snake and Ladder Game -> Didn't put much thought into design and focused mainly on implementation. The interviewer wasn’t happy with the design choice and the candidate couldn’t defend their design choices.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3
Questions:
- Compress Array such that the product of the pair with adjacent elements is less than k, return the size of the array after doing so.
- The candidate was able to solve this but the interviewer was very unhappy with the fact that the candidate said O(2n) and O(n) are the same. The candidate was able to optimize it to O(n) and constant space.
- Monotonic stack question -> The interviewer asked to explain the approach since there were only 10 minutes left. The candidate was able to give the brute force solution and was aware of the stack approach but just couldn’t explain and cover the corner cases.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.