Round 1
Questions: The question was similar to Leetcode's Time Based Key Value Store. The main idea was to process a series of post/delete statements (unsorted) with associated timestamps and compute a balance at any arbitrary timestamp.
Candidate's Approach
The candidate used a priority queue to sort the statements and a tree map to fetch the balance at an arbitrary timestamp.
Interviewer's Feedback
No feedback provided.