-
Notifications
You must be signed in to change notification settings - Fork 13
Interview Experience 155 (Intern)
pkkp86nitd edited this page Aug 28, 2019
·
1 revision
"Round 1:
- 7 debugging questions(normal codes).
- 25 Reasoning questions
- 2 coding ques.
- Simple returning element position in matrix if present else -1,-1 return vale should pe pair.
- CPU Scheduling based ques (Round Robin)
Round 2:
- Find time complexity of given nested loop.
- Symmetric tree code
- Given an array where each vale denote row value task is to join all rows with minimised cost . At one time we can join only two rows and cost of joining two rows is there sum of value.
- An infinite stream of numbers is coming we have to tell 7th largest number at any point of time.
- Theoretical questions related to OOP's.
Time and space complexity of all codes.
"