Microsoft Logo

Microsoft Questions

Here are the LeetCode questions for Microsoft.

Total: 1401
Easy: 387
Medium: 790
Hard: 224
Progress: 0%

Topic Frequency Analysis

All Topics

Rank Topic Frequency Percentage
1 Array 683
48.8%
2 String 330
23.6%
3 Hash Table 283
20.2%
4 Dynamic Programming 217
15.5%
5 Math 209
14.9%
6 Sorting 175
12.5%
7 Depth-First Search 151
10.8%
8 Greedy 146
10.4%
9 Tree 122
8.7%
10 Binary Search 117
8.4%
11 Breadth-First Search 116
8.3%
12 Two Pointers 113
8.1%
13 Binary Tree 104
7.4%
14 Matrix 96
6.9%
15 Database 90
6.4%
16 Bit Manipulation 82
5.9%
17 Stack 78
5.6%
18 Design 67
4.8%
19 Heap (Priority Queue) 65
4.6%
20 Graph Theory 61
4.4%
21 Simulation 60
4.3%
22 Prefix Sum 58
4.1%
23 Backtracking 57
4.1%
24 Sliding Window 57
4.1%
25 Linked List 49
3.5%
26 Counting 49
3.5%
27 Divide and Conquer 35
2.5%
28 Enumeration 35
2.5%
29 Recursion 33
2.4%
30 Union-Find 30
2.1%
31 Trie 29
2.1%
32 Binary Search Tree 28
2.0%
33 Monotonic Stack 25
1.8%
34 Queue 22
1.6%
35 Ordered Set 20
1.4%
36 Topological Sort 19
1.4%
37 Memoization 19
1.4%
38 Segment Tree 17
1.2%
39 Number Theory 17
1.2%
40 Hash Function 15
1.1%
41 Binary Indexed Tree 14
1.0%
42 Interactive 14
1.0%
43 Bitmask 14
1.0%
44 Rolling Hash 12
0.9%
45 Game Theory 11
0.8%
46 Geometry 10
0.7%
47 String Matching 10
0.7%
48 Combinatorics 10
0.7%
49 Data Stream 9
0.6%
50 Brainteaser 8
0.6%
51 Randomized 8
0.6%
52 Shortest Path 8
0.6%
53 Merge Sort 7
0.5%
54 Counting Sort 7
0.5%
55 Doubly-Linked List 6
0.4%
56 Bucket Sort 6
0.4%
57 Iterator 6
0.4%
58 Sweep Line 4
0.3%
59 Monotonic Queue 4
0.3%
60 Suffix Array 3
0.2%
61 Quickselect 3
0.2%
62 Probability and Statistics 3
0.2%
63 Concurrency 2
0.1%
64 Radix Sort 2
0.1%
65 Eulerian Circuit 2
0.1%
66 Reservoir Sampling 1
0.1%
67 Rejection Sampling 1
0.1%
68 Shell 1
0.1%
69 Minimum Spanning Tree 1
0.1%
No. Question Title Link Difficulty Solved
1 Maximum Capacity Within Budget Visit Medium
2 Count Residue Prefixes Visit Easy
3 Count Routes to Climb a Rectangular Grid Visit Hard
4 Maximum Subgraph Score in a Tree Visit Hard
5 Stable Subarrays With Equal Boundary and Interior Sum Visit Medium
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 1401 questions for free!

Log In

Frequently Asked Questions

Common questions about Microsoft interviews