Round 1
Questions:
-
Word Break - Leetcode Problem
- Expectation was to first provide a recursive solution, then a DP solution, and finally optimize the contains check where we check whether any word is present in the set of the given input word list.
- Expectation was to come up with a Trie-based approach for optimization.
-
HLD - Notification system
- Counter questions included how to handle push-based systems vs pull-based systems where clients ask vs clients are fed the response. Callback URLs?
Candidate's Approach
- The candidate struggled with the Trie-based approach due to being out of touch with it, which led to taking a lot of time to come up with a working solution for the Word Break problem.
- The second question regarding the notification system went well.
Interviewer's Feedback
No feedback provided.