Patterns
backtracking

34 problems

#

Title

Acceptance

Difficulty

1

Triplet Sum to Zero (medium)
sorting
two pointers
array
+3 more

22.2%

Med.

2

Problem Challenge 1: Permutation in a String (hard)
string
sliding window
hash map
+1 more

16.3%

hard

3

string
hash map
sliding window
+1 more

29.1%

hard

4

20.0%

hard

5

23.2%

hard

6

58.6%

easy

7

graph
depth-first search
breadth-first search
+2 more

64.2%

Med.

8

subsets
backtracking
array
+1 more

60.4%

easy

9

subsets
array
backtracking

40.4%

easy

10

recursion
backtracking
array
+2 more

58.9%

Med.

11

recursion
backtracking
string
+2 more

56.7%

Med.

12

backtracking
string
recursion

28.0%

hard

13

string
backtracking
recursion
+1 more

70.2%

hard

14

greedy algorithm
string
backtracking
+3 more

44.5%

hard

15

25.3%

hard

16

string
recursion
backtracking
+3 more

33.1%

easy

17

greedy algorithm
backtracking
string matching
+3 more

15.3%

Med.

18

dynamic programming
recursion
greedy algorithm
+2 more

42.7%

Med.

19

dynamic programming
recursion
subsets
+1 more

35.0%

Med.

20

dynamic programming
recursion
greedy algorithm
+3 more

50.7%

hard

21

dynamic programming
recursion
backtracking
+2 more

44.6%

hard

22

backtracking
recursion
dynamic programming

46.4%

Med.

23

depth-first search
backtracking
graph algorithms
+3 more

28.7%

Med.

24

recursion
backtracking
divide and conquer
+1 more

36.3%

Med.

25

44.3%

Med.

26

backtracking
recursion

74.3%

hard

27

trie
string
depth-first search
+3 more

35.5%

Med.

28

graph
topological sort
recursion
+1 more

20.0%

hard

29

array
backtracking
stack
+1 more

36.5%

Med.

30

recursion
string
backtracking
+1 more

45.2%

Med.

31

dynamic programming
array
greedy algorithm
+2 more

20.3%

Med.

32

dynamic programming
recursion
string
+1 more

17.2%

Med.

33

dynamic programming
recursion
string
+1 more

40.8%

Med.

34

trie
string
depth-first search
+3 more

35.5%

Med.