Round2 (PSDS Round)(60mins): Problem 1 - Given a set of unique elements, print the power set. For eg- {1, 2, 3} Power set will be - {{}, {1}, {2}, {3}, {1,2}, {2,3}, {1,3}, {1,2,3}} ---> have coded using recursion. ---> need to dry run the code for above test case.
One specific question was difference between Deadlock Avoidance and Deadlock Prevention, and what is Banker's Algorithm.
Design a calculator on React Native from scratch.
Signed NDA, cannot reveal the details. Mostly data structure and algorithm, not difficult. Be sure you prepare well with CS fundamental.
1 puzzle question, but basically , it was a divide-n-conquer which I had to convert into.
System Design Round - 1. Design LRU Cache. What data structures will be used, and how will it be implemented? 2. Questions related to my projects. 3. Standard Java related questions. (final, static, JVM, GC, etc.) 4. How and where are methods stored?
None, all straight forward questions. Try to clear the ambiguous before starting tackling it.
why do you want to work at MS?
Explain Linked List witha an example and a code
Basic data structures and algorithms. Also about OOD as well.
Viewing 491 - 500 interview questions