Round 1 (DSA)
Questions:
- Problem 1: Similar to Number of Visible People in a Queue
- Problem 2: Same as Find the Longest Equal Subarray
- Was able to pass all test cases for problem 1 and 11/15 for problem 2.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2 (Machine Coding)
Questions: Design a Splitwise application. Expenses could be split in 3 ways: EQUAL, EXACT, PERCENTAGE. Had to implement the following methods:
addUser() splitExpense() showExpenses() showExpensesForUser()
- Structured the code well and followed a few design patterns but was unable to complete in time.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.