Level 7

Dynamic Programming

TUTORIALS

1. Dynamic Programming ( DP ) introduction : View Tutorial
2. Dynamic Programming Examples : View Tutorial
Greedy or dp
Problem Score Companies Time Status
Tushar's Birthday Bombs 200
83:16
Jump Game Array 225 33:45
Min Jumps Array 300 55:06
Suffix / prefix dp
Problem Score Companies Time Status
Sub Matrices with sum Zero 200
74:38
Coin Sum Infinite 225
51:33
Best Time to Buy and Sell Stocks I 300 23:55
Max Product Subarray 300 52:43
Arrange II 350 71:07
Adhoc
Problem Score Companies Time Status
Largest area of rectangle with permutations 200
61:26
Best Time to Buy and Sell Stocks II 225 32:43
Knapsack
Problem Score Companies Time Status
N digit numbers with digit sum S 200
57:15
Tushar's Birthday Party 200 59:59
Flip Array 200
82:32
Equal Average Partition 350 84:35
Derived dp
Problem Score Companies Time Status
Max Sum Without Adjacent Elements 225 47:49
2d string dp
Matrix dp
Problem Score Companies Time Status
Min Sum Path in Matrix 300 25:50
Dungeon Princess 300
57:43
Min Sum Path in Triangle 300
35:54
Unique Paths in a Grid 300
27:19
Max Rectangle in Binary Matrix 350
61:41
Rod Cutting 350
78:33
Queen Attack 350
76:37
Multiply dp
Problem Score Companies Time Status
Intersecting Chords in a Circle 300
58:39
Unique Binary Search Trees II 400 27:48
Count Permutations of BST 400
83:19
Preprocess dp
Problem Score Companies Time Status
Max Rectangle in Binary Matrix 350
61:41
Dp optimized backtrack
Problem Score Companies Time Status
Word Break II 350
IBM
54:51
Tree dp
Problem Score Companies Time Status
Max Sum Path in Binary Tree 400 43:20
Breaking words
Problem Score Companies Time Status
Word Break 400
IBM
50:36
Palindrome Partitioning II 400 44:14
Scramble String 500
55:03