Open In App

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/amp/
2) https://www.geeksforgeeks.org/zig-zag-traversal-of-a-binary-tree-using-recursion/amp/
3) https://www.geeksforgeeks.org/minimum-distance-between-two-occurrences-of-maximum/amp/



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

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



Article Tags :