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