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