First, they ask for a transcript and resume.

Then, they schedule a phone interview for the first round.

After clearing the first round, you are transferred to HR to schedule the second round.

Experience-wise: I learned so much, even though I did not get an offer.

Round 1:

• Build a linked list
• Print a linked list
• Check if two linked lists are the same
• Finally, given a linked list, remove all elements whose indices do not match Fibonacci numbers.

Round 2:

• Memory layout questions (stack, heap, static, code): Given a code snippet, identify where each line belongs in memory.
• How to implement a stack (what data structure is suitable), such as a linked list or an array.
• Discuss the pros and cons of each implementation in terms of memory.