- Published on
Adobe | CS2 | Noida | August 2024 [Reject]
- Author
- Shared Anonymously
Date: August, 2024
- Round 1 [DSA + CPP]
- https://leetcode.com/problems/design-add-and-search-words-data-structure/
- Polymorphism(static & dyamic). 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.
- Round 2 [DSA + Design + CPP + Puzzle]
- 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 exit, explain
- In what cases can we make constructor & desctructor 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, where it is a circle ?
- Round 3 [DSA]
- 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 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: Recusively the parent can also become dirty if its child node have become dirty].
Report • Mark as Helpful