-
Notifications
You must be signed in to change notification settings - Fork 13
Interview Experience 113
Round 1- The Selection process started with an Online Coding round.
- 2 Coding Questions: (i) Dynamic Programming (ii) Array
Round 2- Technical interview
-
Discussion about the project that I've done in summer internship and questions related to my project on php.
-
Puzzle 1: There is an ant in a cube placed at one corner and you need to find the shortest path to the diagonally opposite corner. The ant can not fly that is obvious.
-
Puzzle 2: There is an 8 by 8 chessboard in which two diagonally opposite corners have been cut off.You are given 31 dominos, and a single domino can cover exactly two squares. Can you use the 31 dominos to cover the entire board ?
-
Coding Question 1: Stack using queue
-
Coding Question 2: Given a boolean matrix find the row with maximum number of 1s
-
Coding Question 3: BFS & DFS
-
Coding Question 4: Sorting Algorithms
Round 3 -
- Next greater element on right side
- Design a data structure which insert, delete and find random number in O(1).
- Hashmap working
- Detect loop in a linked list
- Level Order Traversal
- Cookies related stuff( how browser save login information )
- Design database of Restaurant service.
- Given an array of size having number in range of n find duplicate in O(n) time and O(1) extra space and array should not be lost
- Maximum and Minimum number of binary search tree.
- Tree related Question ( traversal in level order and some binary search question)
Round 4 -
- Database concurrency
- Computer network concepts
- Around resume
- HR Question