-
Notifications
You must be signed in to change notification settings - Fork 13
Interview Experience 160 (Intern)
pkkp86nitd edited this page Aug 29, 2019
·
1 revision
"Round 1:(Online Coding Round )
- Find an element in a row wise and column wise sorted 2-D matrix.
- Find if a path is possible between source and destination in a 2-D matrix where destination is marked by value 9 , invalid path by value 0 and valid path by 1.
Round 2:(Final-Technical)
-
Implementation of stack with class declaration using any data structure. You have to implement functions of push, pop, find middle, delete middle.
The expected complexities were not stated in the begining but the interviewer asked to improve it and it eventually reduced down to constant time and constant space.
"