Round 1
Questions: Given a list of logs where each log represents a userId and a webpage. Find the maximum 3-page sequence visited by the users. Logs: { (user1, webpage1), (user2, webpage1), (user1, webpage2), (user1, webpage3), (user2, webpage4) } This would give webpage1 -> webpage2 -> webpage3 as the answer since it is the 3-page sequence visited maxm times (1 time by user1).
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2
Questions:
- Given a binary tree. Start a fire from any given node that spreads fire to adjacent nodes with each unit of time. Find total time to burn whole tree.
- Frog Jump Problem
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3
Questions: Hiring Manager round. LLD. Design Parking system. Classes, fields and methods were what was expected.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 4
Questions: Bar Raiser HLD. Design notification Service.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.