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