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
74:52
Jump Game Array 225 38:47
Min Jumps Array 300 64:58
Matrix dp
Problem Score Companies Time Status
Kingdom War 200
51:52
Min Sum Path in Matrix 300 28:52
Dungeon Princess 300
59:08
Min Sum Path in Triangle 300
39:47
Unique Paths in a Grid 300
30:43
Max Rectangle in Binary Matrix 350
69:56
Rod Cutting 350
75:52
Queen Attack 350
73:47
Suffix / prefix dp
Problem Score Companies Time Status
Sub Matrices with sum Zero 200
70:45
Coin Sum Infinite 225
58:57
Best Time to Buy and Sell Stocks I 300 26:34
Max Product Subarray 300 59:19
Arrange II 350 67:56
Adhoc
Knapsack
Problem Score Companies Time Status
N digit numbers with digit sum S 200
61:27
Tushar's Birthday Party 200 58:45
Flip Array 200
78:55
Equal Average Partition 350 82:59
Derived dp
Problem Score Companies Time Status
Max Sum Without Adjacent Elements 225 54:01
2d string dp
Multiply dp
Problem Score Companies Time Status
Intersecting Chords in a Circle 300
62:13
Unique Binary Search Trees II 400 31:55
Count Permutations of BST 400
74:39
Preprocess dp
Problem Score Companies Time Status
Max Rectangle in Binary Matrix 350
69:56
Dp optimized backtrack
Problem Score Companies Time Status
Word Break II 350
IBM
55:33
Tree dp
Problem Score Companies Time Status
Max Sum Path in Binary Tree 400 50:11
Breaking words
Problem Score Companies Time Status
Word Break 400
IBM
56:11
Palindrome Partitioning II 400 52:21
Scramble String 500
54:27