-
Notifications
You must be signed in to change notification settings - Fork 13
Interview Experience 52
sggarg edited this page Aug 13, 2017
·
1 revision
##Round 1 :
- Reverse a linked list(both iterative and recursive)
- Egg dropping puzzle. Variation in which the height of the building is unknown and we have infinite supply of eggs.
- infix evaluation.
- Oops questions
- Project Discussion
##Round 2 :
- Design a snake and ladder game. In-depth discussion on OOPs concepts : access specifiers of different variables ,their role in abstraction and encapsulation, time complexity of the algorithm.
- Basic DBMS Concepts : B-Tree , basic my-sql queries.
- find the sum of a sub-matrix in an array.
##Round 3 :
- Given the position of a knight on an 8X8 chess board, what is the probability that it stays within the chess board after n moves?
- Given a function for encryption of a text, write a function to decrypt it.
- Height of a binary tree