Microsoft Logo

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
48.6%
2 String 343
23.4%
3 Hash Table 294
20.0%
4 Dynamic Programming 229
15.6%
5 Math 223
15.2%
6 Sorting 179
12.2%
7 Depth-First Search 154
10.5%
8 Greedy 150
10.2%
9 Tree 124
8.5%
10 Binary Search 119
8.1%
11 Breadth-First Search 119
8.1%
12 Two Pointers 118
8.0%
13 Binary Tree 105
7.2%
14 Matrix 100
6.8%
15 Database 96
6.5%
16 Bit Manipulation 87
5.9%
17 Stack 82
5.6%
18 Heap (Priority Queue) 69
4.7%
19 Design 68
4.6%
20 Simulation 66
4.5%
21 Backtracking 63
4.3%
22 Graph Theory 63
4.3%
23 Prefix Sum 61
4.2%
24 Sliding Window 60
4.1%
25 Counting 55
3.7%
26 Linked List 50
3.4%
27 Enumeration 38
2.6%
28 Divide and Conquer 35
2.4%
29 Recursion 35
2.4%
30 Union-Find 30
2.0%
31 Trie 29
2.0%
32 Binary Search Tree 28
1.9%
33 Monotonic Stack 27
1.8%
34 Queue 22
1.5%
35 Ordered Set 21
1.4%
36 Topological Sort 20
1.4%
37 Memoization 20
1.4%
38 Segment Tree 19
1.3%
39 Number Theory 19
1.3%
40 Binary Indexed Tree 16
1.1%
41 Bitmask 16
1.1%
42 Hash Function 15
1.0%
43 Interactive 14
1.0%
44 Rolling Hash 12
0.8%
45 Game Theory 12
0.8%
46 Geometry 11
0.7%
47 Combinatorics 11
0.7%
48 String Matching 10
0.7%
49 Data Stream 10
0.7%
50 Brainteaser 8
0.5%
51 Randomized 8
0.5%
52 Shortest Path 8
0.5%
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 Shell 2
0.1%
64 Concurrency 2
0.1%
65 Radix Sort 2
0.1%
66 Eulerian Circuit 2
0.1%
67 Reservoir Sampling 1
0.1%
68 Rejection Sampling 1
0.1%
69 Minimum Spanning Tree 1
0.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 In

Frequently Asked Questions

Common questions about Microsoft interviews