Microsoft Coding Interview Questions
71 problems · 14 Easy 48 Medium 9 Hard
Microsoft problems
Microsoft runs four to five rounds including a preparation session and an ASK (Ask-See-Know) behavioral component. Coding skews toward medium arrays, strings, and trees with an emphasis on communication. Clear trade-off discussion is scored as highly as the code itself.
Sliding Window 4 problems
Two Pointers 4 problems
| Valid Palindrome | Easy | ||
| Remove Duplicates from Sorted Array | Easy | ||
| Sort Colors | Medium | ||
| Valid Palindrome II | Easy |
Binary Search 4 problems
| Search in Rotated Sorted Array | Medium | ||
| Find Minimum in Rotated Sorted Array | Medium | ||
| Search a 2D Matrix | Medium | ||
| Median of Two Sorted Arrays | Hard |
Prefix Sum 1 problems
| Product of Array Except Self | Medium |
Hash Map / Set 4 problems
| Two Sum | Easy | ||
| Group Anagrams | Medium | ||
| Valid Anagram | Easy | ||
| LRU Cache | Medium |
Queue / BFS 3 problems
| Number of Islands | Medium | ||
| Binary Tree Level Order Traversal | Medium | ||
| 01 Matrix | Medium |
Heap / Priority Queue 2 problems
Linked List 10 problems
| Reverse Linked List | Easy | ||
| Linked List Cycle | Easy | ||
| Merge Two Sorted Lists | Easy | ||
| Add Two Numbers | Medium | ||
| Remove Nth Node From End of List | Medium | ||
| Copy List with Random Pointer | Medium | ||
| Palindrome Linked List | Easy | ||
| Swap Nodes in Pairs | Medium | ||
| Rotate List | Medium | ||
| Reverse Nodes in k-Group | Hard |
Trees / DFS 8 problems
Dynamic Programming 8 problems
| Coin Change | Medium | ||
| Longest Increasing Subsequence | Medium | ||
| Maximum Subarray | Medium | ||
| Decode Ways | Medium | ||
| Best Time to Buy and Sell Stock | Easy | ||
| Longest Palindromic Substring | Medium | ||
| Maximum Product Subarray | Medium | ||
| Regular Expression Matching | Hard |
Greedy 3 problems
| Jump Game | Medium | ||
| Meeting Rooms II | Medium | ||
| Minimum Number of Arrows to Burst Balloons | Medium |
Backtracking 5 problems
| Permutations | Medium | ||
| Word Search | Medium | ||
| Letter Combinations of a Phone Number | Medium | ||
| Generate Parentheses | Medium | ||
| N-Queens | Hard |
Trie 2 problems
| Implement Trie (Prefix Tree) | Medium | ||
| Word Search II | Hard |
Bit Manipulation 3 problems
| Missing Number | Easy | ||
| Number of 1 Bits | Easy | ||
| Sum of Two Integers | Medium |
Matrix 5 problems
| Rotate Image | Medium | ||
| Spiral Matrix | Medium | ||
| Set Matrix Zeroes | Medium | ||
| Game of Life | Medium | ||
| Search a 2D Matrix II | Medium |
Graphs 2 problems
| Surrounded Regions | Medium | ||
| Network Delay Time | Medium |
Monotonic Stack 1 problems
| Online Stock Span | Medium |
Intervals 1 problems
| Meeting Rooms | Easy |
Stack 1 problems
| Basic Calculator II | Medium |