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:29
Jump Game Array 225 30:42
Min Jumps Array 300 54:03
Suffix / prefix dp
Problem Score Companies Time Status
Sub Matrices with sum Zero 200
75:44
Coin Sum Infinite 225
52:39
Best Time to Buy and Sell Stocks I 300 22:40
Max Product Subarray 300 49:13
Arrange II 350 73:25
Knapsack
Problem Score Companies Time Status
N digit numbers with digit sum S 200
58:31
Tushar's Birthday Party 200 60:12
Flip Array 200
82:40
Equal Average Partition 350 84:53
Adhoc
Problem Score Companies Time Status
Best Time to Buy and Sell Stocks II 225 29:47
Largest area of rectangle with permutations 300
58:08
Derived dp
Problem Score Companies Time Status
Max Sum Without Adjacent Elements 225 44:30
2d string dp
Matrix dp
Problem Score Companies Time Status
Min Sum Path in Matrix 300 24:01
Dungeon Princess 300
57:19
Min Sum Path in Triangle 300
33:19
Unique Paths in a Grid 300
25:02
Max Rectangle in Binary Matrix 350
63:34
Rod Cutting 350
80:58
Queen Attack 350
76:33
Multiply dp
Problem Score Companies Time Status
Intersecting Chords in a Circle 300
61:23
Unique Binary Search Trees II 400 25:13
Count Permutations of BST 400
86:17
Preprocess dp
Problem Score Companies Time Status
Max Rectangle in Binary Matrix 350
63:34
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 39:44
Breaking words
Problem Score Companies Time Status
Word Break 400
IBM
51:25
Palindrome Partitioning II 400 43:34
Scramble String 500
55:20
Click here to start solving coding interview questions