array
116 problems
# | Title | Acceptance | Difficulty |
|---|---|---|---|
1 | hash map hash set array +1 more | 55.5% | easy |
2 | string array two pointers | 44.3% | easy |
3 | string array two pointers +1 more | 22.6% | easy |
4 | array string two pointers +1 more | 27.9% | easy |
5 | array counting hash map | 75.5% | easy |
6 | two pointers array binary search +1 more | 42.5% | easy |
7 | array sorting two pointers +1 more | 42.6% | easy |
8 | array sorting two pointers +3 more | 35.6% | easy |
9 | sorting two pointers array +3 more | 22.3% | Med. |
10 | sorting array greedy algorithm | 12.3% | Med. |
11 | sorting two pointers array +1 more | 22.7% | Med. |
12 | array sorting two pointers +1 more | 29.6% | Med. |
13 | array two pointers sorting +1 more | 12.8% | Med. |
14 | graph array two pointers +1 more | 17.3% | hard |
15 | sliding window greedy algorithm array +1 more | 46.4% | easy |
16 | sliding window array two pointers +2 more | 19.7% | easy |
17 | sliding window two pointers array +1 more | 39.5% | Med. |
18 | sliding window two pointers array +1 more | 48.8% | hard |
19 | string hash map array +3 more | 23.3% | hard |
20 | sliding window array two pointers | 29.0% | hard |
21 | subsets sliding window array | 25.0% | hard |
22 | merge intervals array | 22.0% | Med. |
23 | merge intervals two pointers array | 48.1% | Med. |
24 | sorting greedy algorithm array | 28.1% | Med. |
25 | greedy algorithm array sorting | 48.4% | hard |
26 | sorting cyclic sort array | 48.4% | easy |
27 | 42.6% | easy | |
28 | array cyclic sort sorting +1 more | 54.4% | easy |
29 | array hash map | 49.2% | easy |
30 | array cyclic sort two pointers +1 more | 67.2% | easy |
31 | sorting array counting +1 more | 48.2% | easy |
32 | array sorting recursion +3 more | 28.9% | Med. |
33 | array sorting recursion +2 more | 16.8% | hard |
34 | linked list recursion sorting +4 more | 80.1% | easy |
35 | linked list array recursion +1 more | 53.1% | Med. |
36 | linked list linked list reversal recursion +1 more | 51.6% | Med. |
37 | stack queue array +2 more | 30.1% | easy |
38 | array string recursion | 46.7% | Med. |
39 | stack array monotonic stack | 31.5% | easy |
40 | stack monotonic stack array +1 more | 55.5% | easy |
41 | monotonic stack array stack | 54.9% | easy |
42 | stack recursion string +1 more | 37.1% | Med. |
43 | subsets array stack +3 more | 67.6% | Med. |
44 | greedy algorithm stack string +1 more | 12.7% | hard |
45 | hash map counting array +1 more | 61.4% | easy |
46 | hash map counting array +3 more | 0.0% | easy |
47 | hash map counting string +1 more | 0.0% | easy |
48 | binary tree breadth-first search level order traversal +3 more | 64.1% | Med. |
49 | graph depth-first search breadth-first search +2 more | 42.8% | easy |
50 | graph breadth-first search depth-first search +3 more | 49.4% | easy |
51 | graph breadth-first search depth-first search +4 more | 62.6% | Med. |
52 | binary search sorting graph algorithms +3 more | 62.6% | hard |
53 | subsets backtracking array +1 more | 60.4% | easy |
54 | subsets array backtracking | 40.5% | easy |
55 | recursion backtracking array +2 more | 58.9% | Med. |
56 | string backtracking recursion +1 more | 70.3% | hard |
57 | binary tree binary search tree recursion +2 more | 30.1% | hard |
58 | binary search sorting array +1 more | 32.8% | easy |
59 | binary search array sorting | 23.7% | Med. |
60 | binary search array recursion | 36.9% | Med. |
61 | binary search array sorting | 39.4% | Med. |
62 | binary search array recursion +1 more | 33.8% | Med. |
63 | binary search array sorting | 24.1% | Med. |
64 | binary search array sorting +1 more | 35.0% | easy |
65 | binary search array recursion +1 more | 31.2% | Med. |
66 | binary search array recursion +1 more | 23.1% | Med. |
67 | binary search array recursion +1 more | 24.3% | Med. |
68 | array hash map hash set +3 more | 82.6% | easy |
69 | array sorting counting +1 more | 68.2% | Med. |
70 | array matrix two pointers +1 more | 58.3% | hard |
71 | heap top k elements priority queue +2 more | 63.6% | easy |
72 | top k elements sorting array +2 more | 42.8% | easy |
73 | heap priority queue top k elements +3 more | 25.0% | easy |
74 | top k elements sorting array +2 more | 56.0% | Med. |
75 | heap priority queue top k elements +2 more | 52.7% | Med. |
76 | binary search sorting array +2 more | 26.6% | Med. |
77 | greedy algorithm hash map array | 22.7% | Med. |
78 | sorting array top k elements | 51.3% | Med. |
79 | greedy algorithm string backtracking +3 more | 44.5% | hard |
80 | sorting priority queue heap +3 more | 31.4% | hard |
81 | string recursion backtracking +3 more | 33.1% | easy |
82 | greedy algorithm array sorting +1 more | 30.5% | Med. |
83 | greedy algorithm backtracking string matching +3 more | 15.3% | Med. |
84 | array sorting two pointers +1 more | 21.8% | Med. |
85 | dynamic programming recursion backtracking +2 more | 44.6% | hard |
86 | depth-first search backtracking graph algorithms +3 more | 28.7% | Med. |
87 | recursion backtracking divide and conquer +1 more | 36.4% | Med. |
88 | string string matching trie +3 more | 30.5% | easy |
89 | string array dynamic programming +3 more | 53.0% | Med. |
90 | array string sorting | 36.8% | Med. |
91 | hash map sorting array +1 more | 83.4% | easy |
92 | array backtracking stack +1 more | 36.5% | Med. |
93 | greedy algorithm sorting array | 20.2% | Med. |
94 | sliding window two pointers array +1 more | 33.6% | Med. |
95 | prefix sum array two pointers +1 more | 42.7% | easy |
96 | array prefix sum recursion +1 more | 67.0% | easy |
97 | prefix sum hash map array +1 more | 29.0% | Med. |
98 | prefix sum sliding window array +1 more | 56.6% | Med. |
99 | prefix sum hash map array +1 more | 50.5% | Med. |
100 | array sorting prefix sum +1 more | 73.9% | Med. |