Round 1: Hacker rank OA
Questions: Specific question not provided.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2: Coding
Questions:
-
There are 3 kinds of queries on a stream of numbers:
- (1, X) - Add X in your list of numbers
- (2, X) - Add X to all the existing numbers
- (3) - Print the min number so far and remove it from the list
For e.g.
(1, 3) - current list = [3] (1, 5) - current list = [3, 5] (2, 10) - add 10 to all the existing numbers, list becomes [13, 15] (1, 12) - current list = [12, 13, 15] (3) - print the minimum number and remove it from the list: 12 -
A variation of the coin change problem.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3: Coding
Questions: Given a large number as a string (size up to 10^5). Find the count of subsequences which are divisible by 4. Since the count could be a large number, return the count modulo 10^9 + 7.
Candidate's Approach
Initially stuck for a long time but received helpful hints from the interviewer regarding divisibility by 4. Eventually came up with a solution, and after debugging together, arrived at a fully working code.
Interviewer's Feedback
No feedback provided.
Round 4: System Design
Questions:
- Discussion on how to tackle the celebrity problem on Twitter (or any social media).
- Discussion on incremental, blue-green rollout/deployment strategy and how to leverage it to gracefully rollout a few features in a mobile app.
Candidate's Approach
Prepared for the celebrity problem and discussed feasible solutions. Leveraged work experience to discuss rollout/deployment strategies effectively.
Interviewer's Feedback
No feedback provided.
Round 5: Hiring Manager
Questions: Standard behavioral questions and discussion around the team and their work.
Candidate's Approach
Participated in a decent discussion about past work, areas of interest, and reasons for seeking a change.
Interviewer's Feedback
No feedback provided.