Data Structures
string
57 problems
# | Title | Acceptance | Difficulty |
|---|---|---|---|
1 | string hash set counting +1 more | 31.0% | easy |
2 | two pointers string array | 44.2% | easy |
3 | string two pointers | 22.5% | easy |
4 | string hash map counting +1 more | 38.3% | easy |
5 | array string two pointers +2 more | 27.8% | easy |
6 | string two pointers stack +1 more | 16.7% | Med. |
7 | sliding window string hash map +1 more | 28.0% | Med. |
8 | sliding window string hash map +2 more | 29.8% | hard |
9 | sliding window hash map string +2 more | 16.2% | hard |
10 | string sliding window hash map +1 more | 29.0% | hard |
11 | sliding window hash map string +1 more | 20.0% | hard |
12 | sliding window hash map string +1 more | 23.2% | hard |
13 | linked list recursion sorting +4 more | 80.1% | easy |
14 | stack string depth-first search +1 more | 30.1% | easy |
15 | stack string | 85.1% | easy |
16 | binary search array string | 46.7% | Med. |
17 | stack string simulation | 25.2% | Med. |
18 | stack string array +1 more | 58.5% | easy |
19 | stack string counting +2 more | 37.0% | Med. |
20 | greedy algorithm monotonic stack string +1 more | 12.6% | hard |
21 | string hash map counting +1 more | 55.3% | easy |
22 | string hash map counting | 0.0% | easy |
23 | string hash map counting +1 more | 39.7% | easy |
24 | string hash map counting +1 more | 0.0% | easy |
25 | string array hash map +1 more | 24.1% | easy |
26 | string hash map array +1 more | 0.0% | easy |
27 | string hash map counting +1 more | 56.7% | easy |
28 | hash map string counting | 0.0% | easy |
29 | matrix depth-first search hash set +3 more | 62.6% | Med. |
30 | subsets backtracking recursion +2 more | 56.7% | Med. |
31 | backtracking recursion string | 27.9% | hard |
32 | subsets backtracking recursion +2 more | 70.3% | hard |
33 | recursion divide and conquer string +1 more | 67.4% | hard |
34 | modified binary search array binary search +1 more | 36.8% | Med. |
35 | string hash map sorting +2 more | 80.4% | Med. |
36 | top k elements greedy algorithm heap +3 more | 44.4% | hard |
37 | greedy algorithm priority queue string +3 more | 25.3% | hard |
38 | string recursion two pointers +1 more | 33.1% | easy |
39 | string stack recursion +2 more | 48.3% | Med. |
40 | string greedy algorithm monotonic stack +3 more | 18.0% | Med. |
41 | greedy algorithm string counting +1 more | 15.3% | Med. |
42 | backtracking string hash set +1 more | 44.3% | Med. |
43 | trie string n-ary tree | 64.8% | Med. |
44 | string string matching trie +3 more | 30.5% | easy |
45 | trie string depth-first search +3 more | 35.5% | Med. |
46 | string dynamic programming recursion +1 more | 53.0% | Med. |
47 | string trie sorting +3 more | 36.8% | Med. |
48 | stack string simulation +1 more | 37.9% | easy |
49 | string hash map sorting +1 more | 75.6% | Med. |
50 | string stack recursion +1 more | 45.2% | Med. |
51 | string two pointers dynamic programming | 33.0% | Med. |
52 | dynamic programming recursion string +1 more | 17.2% | Med. |
53 | dynamic programming string recursion +3 more | 40.7% | Med. |
54 | string serialize and deserialize array +1 more | 66.1% | Med. |
55 | trie string n-ary tree | 64.8% | Med. |
56 | trie string depth-first search +3 more | 35.5% | Med. |
57 | stack string breadth-first search +3 more | 15.7% | hard |