Microsoft Hiring Drive: Delhi: 3.5 Years Experienced

Microsoft interview for 3.5 years experienced held at Delhi on 23rd Feb 2019.

Round 1 (Written):
1) https://www.geeksforgeeks.org/function-to-check-if-a-singly-linked-list-is-palindrome/
2) https://www.geeksforgeeks.org/zig-zag-traversal-of-a-binary-tree-using-recursion/
3) https://www.geeksforgeeks.org/minimum-distance-between-two-occurrences-of-maximum/

Round 2 F2F:
1) https://www.geeksforgeeks.org/find-maximum-possible-stolen-value-houses/
2) https://www.geeksforgeeks.org/minimum-time-required-so-that-all-oranges-become-rotten/

Round 3 F2F:
1) https://www.geeksforgeeks.org/count-possible-decodings-given-digit-sequence/
2) https://www.geeksforgeeks.org/print-palindromic-permutations-given-string-alphabetic-order/

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



My Personal Notes arrow_drop_up

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

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.