Application and Online Assessment (OA)
Questions:
- Two DSA Questions (70 mins)
- Work Style Assessment: 3 hours
Round 1: DSA Only
Questions:
- Question 1: Design a data structure to perform a task based on ArrayList/LinkedList.
- Question 2: A backtracking problem that required a standard backtracking approach.
Candidate's Approach
The candidate approached the first question by discussing the properties of ArrayList and LinkedList, considering the trade-offs between them. For the second question, they applied the standard backtracking technique, explaining the recursive nature of the solution.
Interviewer's Feedback
No feedback provided.
Round 2: Coding + Leadership Principles (LP)
Questions:
- Question 1: A problem related to contiguous subarrays and the sliding window technique.
- Question 2: A question about Tries and strings focusing on unique prefixes.
Leadership Principles Questions: Two questions based on the candidate's internship and full-time experiences.
Candidate's Approach
The candidate explained their approach for both coding questions, detailing the sliding window technique for the first and the Trie structure for the second. They emphasized the importance of explaining the dry run and time complexity during the coding process.
Interviewer's Feedback
No feedback provided.
Round 3: Bar Raiser
Questions:
- DSA Question: A medium-level question related to Maps and Strings.
- Leadership Principles Questions: Several questions focusing on the candidate's experiences.
Candidate's Approach
The candidate explained their approach to the DSA question, focusing on the use of maps for efficient lookups and string manipulations. They also prepared for the leadership principles questions by reflecting on their past experiences.
Interviewer's Feedback
No feedback provided.
Final Status
Result: Selected 🎉 Received an email from the recruiter a week later with the job offer.
Tips from my experience:
- Explain the approach clearly: Break down the problem and share your thought process.
- Ask for clarification when needed: If stuck, don't hesitate to request hints and ask questions to better understand requirements.
- Show step-by-step dry runs: Use example inputs and explain expected outputs.
- Explain complexity: Analyze time complexity with proper Big O notation, explain space complexity, and justify the analysis.