Data Structures
string

58 problems

#

Title

Acceptance

Difficulty

1

Pangram (easy)
string
hash set
counting
+1 more

30.9%

easy

2

Reverse Vowels (easy)
two pointers
string
array

44.1%

easy

3

string
two pointers
simulation

22.5%

easy

4

string
hash map
counting
+1 more

38.2%

easy

5

array
string
two pointers
+2 more

27.7%

easy

6

16.7%

Med.

7

27.9%

Med.

8

29.8%

hard

9

sliding window
hash map
string
+2 more

16.2%

hard

10

string
sliding window
hash map
+1 more

28.9%

hard

11

19.9%

hard

12

sliding window
hash map
string
+1 more

23.1%

hard

13

30.1%

easy

14

85.1%

easy

15

bit manipulation
simulation
string

46.7%

Med.

16

stack
string
simulation
+1 more

25.2%

Med.

17

58.4%

easy

18

37.0%

Med.

19

greedy algorithm
monotonic stack
string
+1 more

12.5%

hard

20

55.3%

easy

21

0.0%

easy

22

39.7%

easy

23

0.0%

easy

24

string
hash map
greedy algorithm
+1 more

24.1%

easy

25

string
hash map
counting
+1 more

0.0%

easy

26

string
hash map
counting
+1 more

56.7%

easy

27

hash map
string
counting
+2 more

0.0%

easy

28

matrix
depth-first search
hash set
+3 more

62.5%

Med.

29

subsets
backtracking
recursion
+2 more

56.7%

Med.

30

backtracking
recursion
string

27.8%

hard

31

subsets
backtracking
recursion
+2 more

70.2%

hard

32

recursion
divide and conquer
string
+1 more

67.5%

hard

33

modified binary search
array
binary search
+1 more

36.8%

Med.

34

string
hash map
sorting
+2 more

80.5%

Med.

35

top k elements
greedy algorithm
heap
+3 more

44.4%

hard

36

greedy algorithm
priority queue
string
+3 more

25.2%

hard

37

string
two pointers
greedy algorithm
+1 more

33.1%

easy

38

string
stack
greedy algorithm
+2 more

48.3%

Med.

39

string
monotonic stack
greedy algorithm
+3 more

17.9%

Med.

40

string
greedy algorithm
counting
+1 more

15.3%

Med.

41

backtracking
matrix traversal
depth-first search
+3 more

28.6%

Med.

42

44.2%

Med.

43

64.8%

Med.

44

string
trie
sorting
+3 more

30.5%

easy

45

trie
string
depth-first search
+3 more

35.5%

Med.

46

string
dynamic programming
hash set
+2 more

53.0%

Med.

47

string
trie
sorting
+3 more

36.8%

Med.

48

topological sort
graph algorithms
string
+2 more

45.5%

hard

49

37.9%

easy

50

string
hash map
sorting
+1 more

75.6%

Med.

51

stack
recursion
string
+1 more

45.1%

Med.

52

string
two pointers
dynamic programming

33.0%

Med.

53

dynamic programming
string
recursion
+1 more

17.2%

Med.

54

dynamic programming
string
recursion
+3 more

40.7%

Med.

55

string
serialize and deserialize
array
+1 more

66.2%

Med.

56

64.8%

Med.

57

trie
string
depth-first search
+3 more

35.5%

Med.

58

string
stack
dynamic programming
+2 more

15.5%

hard