Round 1 - OA:

• 5/7 debugging
• 15/26 aptitude
• 3/3 DSA -> LRU cache, binary search, sliding window, all LeetCode medium problems

Round 2 -> Tech Interview:

• Asked to implement caching for RDBMS - done.
• Delete node from singly linked list with pointer only to that node present (no head) -> direct LeetCode easy.
• Asked a few questions about OS CPU Scheduling and DBMS (both relational and NoSQL) - answered all.

Round 2 - HR Interview:

• Asked system design for an e-commerce app order processing page, taking consistency and optimizations into consideration - solved.
• Asked a few questions about leadership and team management skills.

Result: Accepted for SDE apprenticeship at Morgan Stanley.

How would you dynamically double the memory size of an array in O(1) constant time, infinitely?