Level 7

Dynamic Programming

Previous Next
  • 1. Dynamic Programming ( DP ) introduction :
  • 2. Dynamic Programming ( DP ) example :
Greedy or dp
Problem Score Companies Time Status
Tushar's Birthday Bombs 200
86:30
Jump Game Array 225 31:40
Min Jumps Array 300 54:34
Suffix / prefix dp
Problem Score Companies Time Status
Sub Matrices with sum Zero 200
73:31
Coin Sum Infinite 225
52:24
Best Time to Buy and Sell Stocks I 300 22:56
Max Product Subarray 300 49:46
Arrange II 350 72:19
Adhoc
Problem Score Companies Time Status
Largest area of rectangle with permutations 200
57:14
Best Time to Buy and Sell Stocks II 225 30:41
Knapsack
Problem Score Companies Time Status
N digit numbers with digit sum S 200
58:12
Tushar's Birthday Party 200 59:52
Flip Array 200
82:57
Equal Average Partition 350 85:00
Derived dp
Problem Score Companies Time Status
Max Sum Without Adjacent Elements 225 45:28
2d string dp
Matrix dp
Problem Score Companies Time Status
Min Sum Path in Matrix 300 24:28
Dungeon Princess 300
57:38
Min Sum Path in Triangle 300
34:07
Unique Paths in a Grid 300
25:49
Max Rectangle in Binary Matrix 350
63:01
Rod Cutting 350
80:06
Queen Attack 350
78:46
Multiply dp
Problem Score Companies Time Status
Intersecting Chords in a Circle 300
61:24
Unique Binary Search Trees II 400 26:10
Count Permutations of BST 400
84:04
Preprocess dp
Problem Score Companies Time Status
Max Rectangle in Binary Matrix 350
63:01
Dp optimized backtrack
Problem Score Companies Time Status
Word Break II 350
IBM
55:40
Tree dp
Problem Score Companies Time Status
Max Sum Path in Binary Tree 400 41:10
Breaking words
Problem Score Companies Time Status
Word Break 400
IBM
51:46
Palindrome Partitioning II 400 43:48
Scramble String 500
56:05
Click here to start solving coding interview questions