Data Structures
array
29 problems
# | Title | Acceptance | Difficulty |
|---|---|---|---|
1 | array hash set counting +1 more | 62.7% | easy |
2 | two pointers string array +1 more | 77.8% | easy |
3 | two pointers array binary search +1 more | 100.0% | easy |
4 | two pointers array sorting | 0.0% | easy |
5 | two pointers array sorting | 0.0% | easy |
6 | two pointers sorting array +1 more | 0.0% | Med. |
7 | two pointers sorting array | 0.0% | Med. |
8 | two pointers array sorting +1 more | 0.0% | Med. |
9 | array sliding window two pointers | 0.0% | Med. |
10 | two pointers sorting array | 0.0% | Med. |
11 | two pointers sorting array | 0.0% | Med. |
12 | sliding window array prefix sum +1 more | 0.0% | easy |
13 | merge intervals sorting array +1 more | 0.0% | Med. |
14 | cyclic sort sorting array | 0.0% | easy |
15 | level order traversal tree breadth first search binary tree +2 more | 0.0% | easy |
16 | subsets backtracking recursion +1 more | 0.0% | easy |
17 | binary search modified binary search array +1 more | 0.0% | easy |
18 | array bit manipulation hash map +1 more | 0.0% | easy |
19 | top k elements heap priority queue +2 more | 0.0% | easy |
20 | backtracking recursion array +2 more | 0.0% | Med. |
21 | backtracking matrix traversal depth-first search +3 more | 0.0% | Med. |
22 | array hash map sorting +2 more | 0.0% | easy |
23 | array prefix sum simulation | 0.0% | easy |
24 | array prefix sum simulation | 0.0% | easy |
25 | array prefix sum simulation +1 more | 0.0% | easy |
26 | top k elements array sorting +2 more | 0.0% | hard |
27 | array hash map two pointers +1 more | 0.0% | easy |
28 | array greedy algorithm two pointers +1 more | 0.0% | easy |
29 | monotonic stack array stack | 0.0% | Med. |