Round 1 [DSA + CPP]
Questions:
- Design Add and Search Words - Data Structure
- Polymorphism (static & dynamic), vptr & vtable concept, operator overloading.
- Question related to memory allocation (Stack & heap). Gave a code & fix the issues in it (related to memory allocation). Use of smart pointer.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2 [DSA + Design + CPP + Puzzle]
Questions:
- Design subscribe feature of YouTube (LLD). Classes & their interaction.
- Angle between minute & hour hand at time 03:15.
- vptr & vtable concept, virtual destructor & virtual constructor. If they exist, explain.
- In what cases can we make constructor & destructor private? [Tip: Restricting allocation over heap section & stack section].
- Question involving Nearest Greater to Right & Nearest Greater to Left.
- Given a series of 2D points, how will you determine if it forms a circle?
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3 [DSA]
Questions:
- How does MS-WORD do optimization when you scroll the font? (Optimization related, just like RecyclerView in Android).
- Given an array of sorted numbers, find the closest number.
- Given an n-array tree & a function setDirty() which marks all its children dirty & parent partial dirty. Return a list of dirty nodes & partial dirty nodes. [Tip: Recursively the parent can also become dirty if its child node has become dirty].
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.