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
79:22
Jump Game Array 225 35:58
Min Jumps Array 300 59:28
Suffix / prefix dp
Problem Score Companies Time Status
Sub Matrices with sum Zero 200
73:38
Coin Sum Infinite 225
55:07
Best Time to Buy and Sell Stocks I 300 25:13
Max Product Subarray 300 56:14
Arrange II 350 70:11
Adhoc
Problem Score Companies Time Status
Largest area of rectangle with permutations 200
61:56
Best Time to Buy and Sell Stocks II 225 35:10
Knapsack
Problem Score Companies Time Status
N digit numbers with digit sum S 200
58:23
Tushar's Birthday Party 200 60:27
Flip Array 200
81:40
Equal Average Partition 350 84:28
Derived dp
Problem Score Companies Time Status
Max Sum Without Adjacent Elements 225 50:54
2d string dp
Matrix dp
Problem Score Companies Time Status
Min Sum Path in Matrix 300 27:42
Dungeon Princess 300
57:25
Min Sum Path in Triangle 300
37:35
Unique Paths in a Grid 300
29:11
Max Rectangle in Binary Matrix 350
63:56
Rod Cutting 350
76:17
Queen Attack 350
75:15
Multiply dp
Problem Score Companies Time Status
Intersecting Chords in a Circle 300
58:19
Unique Binary Search Trees II 400 30:00
Count Permutations of BST 400
79:26
Preprocess dp
Problem Score Companies Time Status
Max Rectangle in Binary Matrix 350
63:56
Dp optimized backtrack
Problem Score Companies Time Status
Word Break II 350
IBM
54:43
Tree dp
Problem Score Companies Time Status
Max Sum Path in Binary Tree 400 46:43
Breaking words
Problem Score Companies Time Status
Word Break 400
IBM
50:55
Palindrome Partitioning II 400 47:01
Scramble String 500
56:36