Level 7

Dynamic Programming

Previous Next
  • 1. Dynamic Programming ( DP ) introduction :
  • 2. Dynamic Programming ( DP ) example :
Simple array dp
Greedy or dp
Problem Score Companies Time Status
Tushar's Birthday Bombs New 200
63:44
Jump Game Array 225 29:04
Min Jumps Array 300 53:07
Suffix / prefix dp
Problem Score Companies Time Status
Sub Matrices with sum Zero New 200
68:19
Coin Sum Infinite 225
55:11
Best Time to Buy and Sell Stocks I 300 22:24
Max Product Subarray 300 48:22
Arrange II 350 75:19
Knapsack
Problem Score Companies Time Status
N digit numbers with digit sum S New 200
43:43
Equal Average Partition 350 82:13
Adhoc
Problem Score Companies Time Status
Best Time to Buy and Sell Stocks II 225 29:10
Derived dp
Problem Score Companies Time Status
Max Sum Without Adjacent Elements 225 45:13
2d string dp
Matrix dp
Problem Score Companies Time Status
Min Sum Path in Matrix 300 22:56
Dungeon Princess 300
54:39
Min Sum Path in Triangle 300
31:34
Unique Paths in a Grid 300
24:11
Max Rectangle in Binary Matrix 350
64:58
Rod Cutting 350
79:17
Queen Attack 350
77:49
Multiply dp
Problem Score Companies Time Status
Intersecting Chords in a Circle 300
58:15
Unique Binary Search Trees II 400 24:03
Count Permutations of BST 400
83:04
Preprocess dp
Problem Score Companies Time Status
Max Rectangle in Binary Matrix 350
64:58
Dp optimized backtrack
Problem Score Companies Time Status
Word Break II 350
IBM
54:15
Tree dp
Problem Score Companies Time Status
Max Sum Path in Binary Tree 400 38:02
Breaking words
Problem Score Companies Time Status
Word Break 400
IBM
50:00
Palindrome Partitioning II 400 41:50
Scramble String 500
51:02
Click here to jump start your coding interview preparation