LevelTagsSprout
SproutsClassBookmarks

#dynamic programming dp

Sort
#LevelTitle# SolvedAvg. TriesRandom
#Title# SolvedAvg. Tries
Diamond V
27463
Longest Unfriendly Subsequence
8
4.00
40
2.58
10
1.10
9
1.78
8
1.63
37
2.08
25
5.52
134
2.31
44
2.11
28
2.07
32
6.06
102
1.93
47
1.17
65
3.14
51
2.02
4
12.00
4
1.00
14
1.36
2
1.00
13
1.31
21
2.29
42
3.43
38
2.03
72
1.67
12
2.67
7
3.14
6
1.00
10
1.40
16
2.13
3
11.67
11
2.09
21
1.00
2
4.00
19
1.26
10
2.10
31
1.74
8
32.00
14
1.07
8
1.63
5
1.80
1
2.00
6
3.67
21
1.67
17
1.35
20
1.80
4
1.25
27
2.22
8
1.25
79
2.05
67
2.12
13754687071727374767781