Round 1
Questions: Q) Find the number of permutations of given number which doesn’t have a leading zero. HackerRank Link
Candidate's Approach
I solved the problem and all test cases passed after submitting the code.
Interviewer's Feedback
No feedback provided.
Round 2
Questions: Q) Find the length of longest increasing subsequence.
Candidate's Approach
I solved it using Dynamic Programming and all test cases passed.
Interviewer's Feedback
No feedback provided.
Round 3
Questions:
- In-depth questions about my current project and tech stack.
- Design snapshot management for a multitenant application, where snapshots should be stored when the user prompts it.
- Design a search feature similar to searching merge requests in Git.
- Basic Java questions, including types and pros and cons of the producer-consumer approach in communication between servers.
Candidate's Approach
We discussed various designs for the snapshot management and mutually agreed on one. For the search feature, I proposed a solution that was accepted, and we discussed optimizations for about 10 minutes. I explained the types and pros and cons of the producer-consumer approach in server communication.
Interviewer's Feedback
He mentioned he was satisfied with the solutions provided and that an HR would contact me soon.