Microsoft Interview Experience | Set 45
Written coding test:
Hey geek! It's time to become a success story instead of reading them. Check out our most renowned DSA Self Paced Course, now at a student-friendly price and become industry ready. And if you are looking for a more complete interview preparation resource, check out Complete Interview Preparation Course that will prepare you for the SDE role of your dreams!
Feeling prepared enough for your interview? Test your skills with our Test Series that will help you prepare for top companies like Amazon, Microsoft, TCS, Wipro, Google and many more!
Given a number in a linked list find the next greater permutation.
With senior developer:
1. given an array. write a function to find if the array satisfies the condition min^2 < max is satisfied. That is it should return 0 or 1 accordingly 2. Given an operation delfirst() which deletes the first element of the array. Given an array. how many such operation is needed to get an array which satisfies the condition 1. 3. Given an operation delfirst() and dellast() which deletes the first element and last element of the array respectively. Given an array. how many such operations is needed to get an array which satisfies the condition 1. F2F 2: with hiring manager: 1. Given a SLL find the longest palindrome in it. F2F 3: with director: non technical. about myself why i am interested in a switch etc etc It was a hiring drive for MBS group bangalore location.. The interview process was easy and well structured. Though the questions are easy the interviewer explored all the intricacies and I had to write full code for all the cases. Taking care of corner cases and optimizing time and space complexities. Each round went for 45min to 1 hr. My suggestion will be brush up your basics. Don't try to write down the optimized code at the very beginning. give a simple solution first and gradually optimize it. 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.