2019 年 2 月 23 日在德里举行的 3.5 年微软面试。
第 1 轮(书面)：
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/
第 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/
第 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/