Level 7

Dynamic Programming

TUTORIALS

1. Dynamic Programming ( Dp ) Introduction :
View Tutorial
2. Dynamic Programming Examples :
View Tutorial

Dynamic Programming Problems

Greedy or dp
Problem Score Companies Time Status
Tushar's Birthday Bombs 200
77:43
Jump Game Array 225 36:42
Min Jumps Array 300 60:55
Matrix dp
Problem Score Companies Time Status
Kingdom War 200
51:38
Min Sum Path in Matrix 300 27:59
Dungeon Princess 300
57:28
Min Sum Path in Triangle 300
38:01
Unique Paths in a Grid 300
29:49
Max Rectangle in Binary Matrix 350
65:33
Rod Cutting 350
76:34
Queen Attack 350
75:52
Suffix / prefix dp
Problem Score Companies Time Status
Sub Matrices with sum Zero 200
72:58
Coin Sum Infinite 225
56:03
Best Time to Buy and Sell Stocks I 300 25:37
Max Product Subarray 300 56:52
Arrange II 350 69:40
Adhoc
Problem Score Companies Time Status
Largest area of rectangle with permutations 200
61:43
Best Time to Buy and Sell Stocks II 225 35:41
Knapsack
Problem Score Companies Time Status
N digit numbers with digit sum S 200
58:03
Tushar's Birthday Party 200 59:52
Flip Array 200
81:23
Equal Average Partition 350 84:09
Derived dp
Problem Score Companies Time Status
Max Sum Without Adjacent Elements 225 51:36
2d string dp
Multiply dp
Problem Score Companies Time Status
Intersecting Chords in a Circle 300
58:37
Unique Binary Search Trees II 400 30:28
Count Permutations of BST 400
78:36
Preprocess dp
Problem Score Companies Time Status
Max Rectangle in Binary Matrix 350
65:33
Dp optimized backtrack
Problem Score Companies Time Status
Word Break II 350
IBM
54:35
Tree dp
Problem Score Companies Time Status
Max Sum Path in Binary Tree 400 47:47
Breaking words
Problem Score Companies Time Status
Word Break 400
IBM
51:43
Palindrome Partitioning II 400 48:38
Scramble String 500
55:58