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