Microsoft IDC Interview Experience | Set 88 (For SDE-2)

Total experience : 8 Years.
Interviewed for : SDE-2

Face to Face Round 1:

  1. Tell us about your project and specific contributions.
  2. How to find intersection of link list.
  3. Length of the longest substring without repeating characters.

Face to Face Round 2:



  1. Tell us about your project and specific contributions.
  2. Remove characters from the first string which are present in the second string.

Face to Face Round 3:

  1. Given a linked list and integer K, reverse the link list in K size slots.
  2. Print a binary tree in spiral order.
  3. Find if a string is interleaved of two other strings. Str3 is said to be interleaving Str1 and Str2, if it contains all characters of Str1 and Str2 and order of all characters in individual strings is preserved.

Face to Face Round 4:

  1. Explain one problem of the conducted interviews and explain how you solved it.
  2. In a BST, two nodes are swapped. Find out these nodes and swap it.

A big Thanks to GeeksforGeeks for providing such a brilliant platform for interview preparation. Keep up the good work 🙂

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.


Write your Interview Experience or mail it to contribute@geeksforgeeks.org



My Personal Notes arrow_drop_up