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
85:29
Jump Game Array 225 32:36
Min Jumps Array 300 54:59
Suffix / prefix dp
Problem Score Companies Time Status
Sub Matrices with sum Zero 200
73:50
Coin Sum Infinite 225
52:15
Best Time to Buy and Sell Stocks I 300 23:30
Max Product Subarray 300 51:02
Arrange II 350 71:45
Adhoc
Problem Score Companies Time Status
Largest area of rectangle with permutations 200
58:59
Best Time to Buy and Sell Stocks II 225 31:34
Knapsack
Problem Score Companies Time Status
N digit numbers with digit sum S 200
58:26
Tushar's Birthday Party 200 59:56
Flip Array 200
82:31
Equal Average Partition 350 84:14
Derived dp
Problem Score Companies Time Status
Max Sum Without Adjacent Elements 225 46:33
2d string dp
Matrix dp
Problem Score Companies Time Status
Min Sum Path in Matrix 300 25:15
Dungeon Princess 300
57:04
Min Sum Path in Triangle 300
34:41
Unique Paths in a Grid 300
26:39
Max Rectangle in Binary Matrix 350
62:41
Rod Cutting 350
80:10
Queen Attack 350
78:07
Multiply dp
Problem Score Companies Time Status
Intersecting Chords in a Circle 300
60:31
Unique Binary Search Trees II 400 27:04
Count Permutations of BST 400
84:37
Preprocess dp
Problem Score Companies Time Status
Max Rectangle in Binary Matrix 350
62:41
Dp optimized backtrack
Problem Score Companies Time Status
Word Break II 350
IBM
55:43
Tree dp
Problem Score Companies Time Status
Max Sum Path in Binary Tree 400 42:07
Breaking words
Problem Score Companies Time Status
Word Break 400
IBM
50:44
Palindrome Partitioning II 400 44:20
Scramble String 500
56:13
Click here to start solving coding interview questions