-
Notifications
You must be signed in to change notification settings - Fork 13
Interview Experience 154 (Intern)
pkkp86nitd edited this page Aug 28, 2019
·
2 revisions
"F2F:Technical(After qualifying online Round)
-
An array of size n is given. You have to find number of triplets having product <=k. He asked me to optimize the code , dry run it and write neat and clean code.
-
Design a data structure which supports insertion, deletion and finding middle element in O(1) time complexity. He asked the logic only and if I had solved it earlier.
-
It was descriptive question. Here is its mathematical form. Find the maximum length of window in an array having sum <= k and closest to k.
-
Find the diameter of a binary tree. He asked me to explain the logic and write its code.
-
It was the slight variation of question https://www.codechef.com/MAY16/problems/FORESTGA He asked me to explain the logic and write its code.
"