Core Pillars
Patterns
199Algorithms
199Data Structures
222two pointers
39fast and slow pointers
1sliding window
15merge intervals
6cyclic sort
3linked list reversal
4stack
21monotonic stack
5hash map
38level order traversal
12tree breadth first search
4tree depth first search
6graph
23matrix traversal
1two heaps
2subsets
7bitwise xor
1top k elements
7k-way merge
5greedy algorithm
390/1 knapsack
1backtracking
34trie
5topological sort
8union-find
3prefix sum
9counting
24simulation
5linear sorting
1serialize and deserialize
1clone
1# | Title | Acceptance | Difficulty |
|---|---|---|---|
1 | hash map hash set array +1 more | 55.5% | easy |
2 | string hash map hashing +1 more | 31.1% | easy |
3 | string array two pointers | 44.3% | easy |
4 | string array two pointers +1 more | 22.6% | easy |
5 | string hash map sorting +2 more | 38.4% | easy |
6 | array string two pointers +1 more | 27.9% | easy |
7 | array counting hash map | 75.5% | easy |
8 | binary search recursion sorting | 15.4% | Med. |
9 | two pointers array binary search +1 more | 42.4% | easy |
10 | array sorting two pointers +1 more | 42.6% | easy |
11 | array sorting two pointers +3 more | 35.6% | easy |
12 | sorting two pointers array +3 more | 22.3% | Med. |
13 | sorting array greedy algorithm | 12.2% | Med. |
14 | sorting two pointers array +1 more | 22.7% | Med. |
15 | array sorting two pointers +1 more | 29.6% | Med. |
16 | sorting two pointers recursion +1 more | 17.3% | Med. |
17 | stack string two pointers +1 more | 16.8% | Med. |
18 | array two pointers sorting +1 more | 12.7% | Med. |
19 | linked list | 64.5% | easy |
20 | linked list two pointers linked list reversal | 59.9% | easy |
21 | linked list fast and slow pointers graph algorithms | 49.7% | Med. |
22 | recursion linked list hash map | 47.3% | Med. |
23 | linked list recursion two pointers | 28.9% | Med. |
24 | linked list two pointers recursion | 56.3% | Med. |
25 | graph array two pointers +1 more | 17.3% | hard |
26 | sliding window greedy algorithm array +1 more | 46.3% | easy |
27 | sliding window array two pointers +2 more | 19.7% | easy |
28 | sliding window string hash map +1 more | 28.0% | Med. |
29 | sliding window two pointers array +1 more | 39.5% | Med. |
30 | string sliding window recursion +1 more | 29.9% | hard |
31 | sliding window two pointers array +1 more | 48.8% | hard |
32 | string sliding window hash map +1 more | 16.3% | hard |
33 | string hash map sliding window +1 more | 29.1% | hard |
34 | sliding window string backtracking +1 more | 20.1% | hard |
35 | string hash map array +3 more | 23.2% | hard |
36 | sliding window array two pointers | 29.0% | hard |
37 | subsets sliding window array | 24.9% | hard |
38 | merge intervals sorting greedy algorithm | 31.3% | Med. |
39 | merge intervals array | 22.0% | Med. |
40 | merge intervals two pointers array | 48.1% | Med. |
41 | sorting greedy algorithm array | 28.1% | Med. |
42 | greedy algorithm sorting | 25.9% | hard |
43 | sorting greedy algorithm | 43.1% | hard |
44 | greedy algorithm array sorting | 48.4% | hard |
45 | sorting cyclic sort array | 48.4% | easy |
46 | 42.5% | easy | |
47 | array cyclic sort sorting +1 more | 54.4% | easy |
48 | array hash map | 49.2% | easy |
49 | array cyclic sort two pointers +1 more | 67.2% | easy |
50 | sorting array counting +1 more | 48.1% | easy |
51 | array sorting recursion +3 more | 28.9% | Med. |
52 | array sorting recursion +2 more | 16.8% | hard |
53 | linked list recursion sorting +4 more | 80.1% | easy |
54 | linked list linked list reversal two pointers +1 more | 31.4% | Med. |
55 | linked list array recursion +1 more | 53.1% | Med. |
56 | linked list linked list reversal recursion +1 more | 51.6% | Med. |
57 | linked list recursion simulation | 22.9% | Med. |
58 | stack queue array +2 more | 30.1% | easy |
59 | stack string | 85.1% | easy |
60 | array string recursion | 46.7% | Med. |
61 | stack array monotonic stack | 31.5% | easy |
62 | stack sorting recursion | 69.7% | easy |
63 | string stack recursion | 25.2% | Med. |
64 | linked list linked list reversal recursion +1 more | 42.0% | easy |
65 | stack string backtracking +1 more | 58.6% | easy |
66 | stack monotonic stack array +1 more | 55.4% | easy |
67 | monotonic stack array stack | 54.9% | easy |
68 | stack recursion string +1 more | 37.1% | Med. |
69 | subsets array stack +3 more | 67.6% | Med. |
70 | greedy algorithm stack string +1 more | 12.7% | hard |
71 | string hash map counting | 55.3% | easy |
72 | hash map string counting | 0.0% | easy |
73 | hash map counting array +1 more | 61.4% | easy |
74 | hash map counting array +3 more | 0.0% | easy |
75 | string counting hash map | 39.7% | easy |
76 | hash map counting string | 0.0% | easy |
77 | greedy algorithm counting string | 24.1% | easy |
78 | hash map counting string | 0.0% | easy |
79 | string hash map counting +1 more | 56.7% | easy |
80 | hash map counting string +1 more | 0.0% | easy |
81 | breadth-first search binary tree level order traversal +1 more | 73.5% | easy |
82 | breadth-first search binary tree queue +1 more | 89.2% | easy |
83 | binary tree breadth-first search level order traversal +3 more | 64.1% | Med. |
84 | binary tree breadth-first search level order traversal +1 more | 82.1% | easy |
85 | breadth-first search binary tree queue +1 more | 90.5% | Med. |
86 | binary tree breadth-first search level order traversal | 54.0% | Med. |
87 | binary tree tree breadth first search level order traversal +2 more | 56.9% | Med. |
88 | binary tree breadth-first search depth-first search +1 more | 21.5% | easy |
89 | breadth-first search level order traversal graph algorithms +1 more | 63.9% | easy |
90 | breadth-first search binary tree level order traversal +1 more | 78.0% | Med. |
91 | binary tree breadth-first search tree depth first search +3 more | 32.1% | Med. |
92 | n-ary tree level order traversal breadth-first search +1 more | 92.5% | hard |
93 | breadth-first search level order traversal binary tree +1 more | 80.1% | Med. |
94 | binary tree tree breadth first search level order traversal +1 more | 76.3% | easy |
95 | binary tree depth-first search recursion | 38.3% | easy |
96 | binary tree recursion depth-first search | 56.9% | Med. |
97 | binary tree recursion depth-first search | 69.0% | Med. |
98 | binary tree recursion depth-first search +1 more | 25.9% | Med. |
99 | binary tree recursion depth-first search +2 more | 24.5% | Med. |
100 | binary tree graph algorithms recursion +2 more | 59.3% | Med. |