Online Round:
The online round had two sections CS and quant of 1 hour each.
CS section:
Interview round 1:
- Tell me about yourself and what you found interesting in the pre-placement talk.
- https://www.geeksforgeeks.org/puzzle-4-pay-an-employee-using-a-gold-rod-of-7-units/amp/
- https://www.geeksforgeeks.org/design-a-stack-that-supports-getmin-in-o1-time-and-o1-extra-space/amp/
Interview round 2:
- Find the middle node of a linked list.
- https://www.geeksforgeeks.org/find-minimum-number-of-coins-that-make-a-change/amp/
- https://www.geeksforgeeks.org/puzzle-16-100-doors/amp/
Interview round 3:
- https://www.geeksforgeeks.org/puzzle-set-35-2-eggs-and-100-floors/amp/
- https://www.geeksforgeeks.org/find-minimum-moves-reach-target-infinite-line/amp/
Interview round 4:
- Reverse a string without library functions.
- Implement LRU cache.
Interview round 5:
- https://www.geeksforgeeks.org/find-the-missing-number/amp/
- A string is given consisting of only 0s, 1s and ‘?’s. Print all possible strings which can be generated by replacing the ‘?’s by either ‘0’ or ‘1’. Eg. if input is 1??0, then the possible output strings will be 1000, 1010, 1100, 1110.
Article Tags :
Recommended Articles