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