Microsoft Questions
Here are the LeetCode questions for Microsoft.
Total: 1467
Easy: 407
Medium: 821
Hard: 239
Progress: 0%
Topic Frequency Analysis
All Topics
| Rank | Topic | Frequency | Percentage |
|---|---|---|---|
| 1 | Array | 713 | |
| 2 | String | 343 | |
| 3 | Hash Table | 294 | |
| 4 | Dynamic Programming | 229 | |
| 5 | Math | 223 | |
| 6 | Sorting | 179 | |
| 7 | Depth-First Search | 154 | |
| 8 | Greedy | 150 | |
| 9 | Tree | 124 | |
| 10 | Binary Search | 119 | |
| 11 | Breadth-First Search | 119 | |
| 12 | Two Pointers | 118 | |
| 13 | Binary Tree | 105 | |
| 14 | Matrix | 100 | |
| 15 | Database | 96 | |
| 16 | Bit Manipulation | 87 | |
| 17 | Stack | 82 | |
| 18 | Heap (Priority Queue) | 69 | |
| 19 | Design | 68 | |
| 20 | Simulation | 66 | |
| 21 | Backtracking | 63 | |
| 22 | Graph Theory | 63 | |
| 23 | Prefix Sum | 61 | |
| 24 | Sliding Window | 60 | |
| 25 | Counting | 55 | |
| 26 | Linked List | 50 | |
| 27 | Enumeration | 38 | |
| 28 | Divide and Conquer | 35 | |
| 29 | Recursion | 35 | |
| 30 | Union-Find | 30 | |
| 31 | Trie | 29 | |
| 32 | Binary Search Tree | 28 | |
| 33 | Monotonic Stack | 27 | |
| 34 | Queue | 22 | |
| 35 | Ordered Set | 21 | |
| 36 | Topological Sort | 20 | |
| 37 | Memoization | 20 | |
| 38 | Segment Tree | 19 | |
| 39 | Number Theory | 19 | |
| 40 | Binary Indexed Tree | 16 | |
| 41 | Bitmask | 16 | |
| 42 | Hash Function | 15 | |
| 43 | Interactive | 14 | |
| 44 | Rolling Hash | 12 | |
| 45 | Game Theory | 12 | |
| 46 | Geometry | 11 | |
| 47 | Combinatorics | 11 | |
| 48 | String Matching | 10 | |
| 49 | Data Stream | 10 | |
| 50 | Brainteaser | 8 | |
| 51 | Randomized | 8 | |
| 52 | Shortest Path | 8 | |
| 53 | Merge Sort | 7 | |
| 54 | Counting Sort | 7 | |
| 55 | Doubly-Linked List | 6 | |
| 56 | Bucket Sort | 6 | |
| 57 | Iterator | 6 | |
| 58 | Sweep Line | 4 | |
| 59 | Monotonic Queue | 4 | |
| 60 | Suffix Array | 3 | |
| 61 | Quickselect | 3 | |
| 62 | Probability and Statistics | 3 | |
| 63 | Shell | 2 | |
| 64 | Concurrency | 2 | |
| 65 | Radix Sort | 2 | |
| 66 | Eulerian Circuit | 2 | |
| 67 | Reservoir Sampling | 1 | |
| 68 | Rejection Sampling | 1 | |
| 69 | Minimum Spanning Tree | 1 | |
| No. | Question Title | Link | Difficulty | Solved |
|---|---|---|---|---|
| 1 | Count Good Subarrays | Visit | Hard | |
| 2 | Maximum Capacity Within Budget | Visit | Medium | |
| 3 | Count Residue Prefixes | Visit | Easy | |
| 4 | Count Routes to Climb a Rectangular Grid | Visit | Hard | |
| 5 | Maximum Subgraph Score in a Tree | Visit | Hard | |
| 6 | Restricted | Restricted | Hard | |
| 7 | Restricted | Restricted | Hard | |
| 8 | Restricted | Restricted | Hard | |
| 9 | Restricted | Restricted | Hard | |
| 10 | Restricted | Restricted | Hard | |
| 11 | Restricted | Restricted | Hard | |
| 12 | Restricted | Restricted | Hard | |
| 13 | Restricted | Restricted | Hard | |
| 14 | Restricted | Restricted | Hard | |
| 15 | Restricted | Restricted | Hard |
Log in to access all 1467 questions for free!
Log InFrequently Asked Questions
Common questions about Microsoft interviews