Level 7

Dynamic Programming

Previous Next
  • 1. Dynamic Programming ( DP ) introduction :
  • 2. Dynamic Programming ( DP ) example :
Suffix / prefix dp
Problem Score Companies Time Status
Coin Sum Infinite 225
55:26
Max Product Subarray 300 47:43
Best Time to Buy and Sell Stocks I 300 22:24
Arrange II 350 74:48
Simple array dp
Problem Score Companies Time Status
Ways to Decode 225 48:41
Stairs 225 10:46
Intersecting Chords in a Circle 300
58:41
Greedy or dp
Problem Score Companies Time Status
Jump Game Array 225 28:40
Min Jumps Array 300 52:23
Derived dp
Problem Score Companies Time Status
Max Sum Without Adjacent Elements 225 45:20
Adhoc
Problem Score Companies Time Status
Best Time to Buy and Sell Stocks II 225 29:10
2d string dp
Multiply dp
Problem Score Companies Time Status
Intersecting Chords in a Circle 300
58:41
Unique Binary Search Trees II 400 23:45
Count Permutations of BST 400
79:51
Matrix dp
Problem Score Companies Time Status
Min Sum Path in Triangle 300
31:34
Min Sum Path in Matrix 300 22:20
Dungeon Princess 300
54:05
Unique Paths in a Grid 300
23:35
Max Rectangle in Binary Matrix 350
64:28
Rod Cutting 350
79:01
Queen Attack 350
81:03
Dp tricky
Preprocess dp
Problem Score Companies Time Status
Max Rectangle in Binary Matrix 350
64:28
Dp optimized backtrack
Problem Score Companies Time Status
Word Break II 350
IBM
54:19
Knapsack
Problem Score Companies Time Status
Equal Average Partition 350 79:45
Breaking words
Problem Score Companies Time Status
Word Break 400
IBM
49:03
Palindrome Partitioning II 400 41:37
Scramble String 500
51:35
Tree dp
Problem Score Companies Time Status
Max Sum Path in Binary Tree 400 37:18
Click here to jump start your coding interview preparation