Microsoft Interview for Software Engineer Hyderabad.
Round 1: (1 hr)
1. Given 3 sorted arrays. Find the common element of all the arrays in O(N) time and no extra space. If there is none, return false.
2. Double linked list: 1 goes to the next node and 1 to the random node. Copy this list. Extra space can be used.
Round 2: (45 mins)
1. Power of a number (x**n) in O(log N) time
2. Given an array which has a duplicate except for 2 elements. Find them. We always have 2 such element.
Round 3: They said me a bye 🙂
If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Related Practice Problems
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course.
In case you wish to attend live classes with industry experts, please refer DSA Live Classes