Round 1:
Written test :
apti
logical
and technical
Round 2:
Programming round time: 1 hour , cannot compile and check
Question 1: given a number find the next large number with same number of 1’s in binary
representation
Eg. If given 2 ans is 4
Question 2: given a binary search tree convert it into sorted doubly linked list
Question 3: find the 2nd largest number in a given array
Round 3: personal interview
Implement a file system. Explain briefly the data structures you would use
Round 4: personal interview
Find the grandparent of a given node using parent pointer
Round 5: personal interview
Tell an efficient way to search in a sorted array but rotated by some k value. K unknown
Implement efficient stack with insertion deletion and find min.
Round 6: Personal interview
Given two sorted linked list, merge them into one.
Write test cases for the same
And some hr questions
Image Courtesy: .telegraph.co.uk and Microsoft
Please Contribute and Share your experience with all by sending mail to 'poratltechinfo@gmail.com'..
Thank you.
0 comments:
Post a Comment