Got shortlisted on the basis of cocubes score. After being shorlisted there was a online coding round of half an hour which consisited of two questions.

First question was easy and second was boolean matrix.. https://www.geeksforgeeks.org/a-boolean-matrix-question/

Candidates shortlisted were called for interview in their office.

Round 1:

1. First, he asked me to brief about yourself and there was a little discussion about my projects and their applications. Then he asked me about my favourite subjects. Then asked if i am comfortable with linked list. Gave a question to reverse three alternate nodes in a singly linked list. https://www.geeksforgeeks.org/reverse-alternate-k-nodes-in-a-singly-linked-list/.
2. Then asked to count ways to reach the n’th stair. Then asked to write code for it.https://www.geeksforgeeks.org/count-ways-reach-nth-stair/
3. After this discussion went on to fibonacci numbers. Then Program for finonacci numbers using recursion, dynamic programming and how to optimize the space.https://www.geeksforgeeks.org/program-for-nth-fibonacci-number/
4. Discussion on dynamic programming and recursion.

Round 2:

1. Small introduction and asked about my college. Then there was detailed discussion on one of my projects. Asked me about my favourite subjects. Questions from operating system. Virtual memory, Paging, Belady’s anomaly, Cache replacement policies, scheduling algorithm, difference between preemptive and non preemptive scheduling, Context Switching, Difference between mutex and semaphore. Programs which i have done in operating system lab.
2. Question on sum of all subarrays in O(n) time, changed it for 2D array.
3. Discussion on dynamic programming and given a question find which algorithm to apply and why.

Could not make  to the third round.

Write your Interview Experience or mail it to contribute@geeksforgeeks.org

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Article Tags :
Practice Tags :

1

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.