Algorithms
dynamic programming

27 problems

​

#

Title

Acceptance

Difficulty

1

Valid Anagram (easy)
string
hash map
sorting
+2 more

38.5%

easy

2

28.9%

Med.

3

hash map
counting
array
+3 more

0.0%

easy

4

binary tree
recursion
depth-first search
+2 more

24.6%

Med.

5

recursion
divide and conquer
dynamic programming

67.2%

hard

6

binary tree
binary search tree
recursion
+2 more

30.1%

hard

7

binary search tree
dynamic programming
recursion
+2 more

34.4%

hard

8

greedy algorithm
string
backtracking
+3 more

44.6%

hard

9

string
recursion
backtracking
+3 more

33.1%

easy

10

greedy algorithm
array
sorting
+1 more

30.5%

Med.

11

greedy algorithm
0/1 knapsack
dynamic programming
+1 more

43.8%

Med.

12

dynamic programming
recursion
greedy algorithm
+2 more

42.7%

Med.

13

dynamic programming
recursion
subsets
+1 more

35.1%

Med.

14

dynamic programming
recursion
greedy algorithm
+3 more

50.7%

hard

15

dynamic programming
recursion
subsets

55.6%

hard

16

dynamic programming
recursion
backtracking
+2 more

44.6%

hard

17

backtracking
recursion
dynamic programming

46.5%

Med.

18

string
array
dynamic programming
+3 more

53.0%

Med.

19

graph algorithms
shortest path
dynamic programming
+2 more

40.9%

Med.

20

dynamic programming
array
greedy algorithm
+1 more

22.3%

Med.

21

dynamic programming
string matching
array
+1 more

33.1%

Med.

22

dynamic programming
array
greedy algorithm
+2 more

20.3%

Med.

23

dynamic programming
recursion
string
+1 more

17.3%

Med.

24

dynamic programming
recursion

65.3%

Med.

25

dynamic programming
recursion
string
+1 more

40.8%

Med.

26

graph algorithms
depth-first search
breadth-first search
+3 more

30.8%

Med.

27

stack
string
breadth-first search
+3 more

15.8%

hard