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
92:11
Jump Game Array 225 29:26
Min Jumps Array 300 53:34
Suffix / prefix dp
Problem Score Companies Time Status
Sub Matrices with sum Zero 200
72:29
Coin Sum Infinite 225
54:26
Best Time to Buy and Sell Stocks I 300 22:01
Max Product Subarray 300 48:02
Arrange II 350 74:30
Knapsack
Problem Score Companies Time Status
N digit numbers with digit sum S 200
55:48
Tushar's Birthday Party 200 56:25
Flip Array 200
71:54
Equal Average Partition 350 82:10
Adhoc
Problem Score Companies Time Status
Best Time to Buy and Sell Stocks II 225 28:58
Largest area of rectangle with permutations 650
50:09
Derived dp
Problem Score Companies Time Status
Max Sum Without Adjacent Elements 225 44:49
2d string dp
Matrix dp
Problem Score Companies Time Status
Min Sum Path in Matrix 300 22:50
Dungeon Princess 300
54:30
Min Sum Path in Triangle 300
31:44
Unique Paths in a Grid 300
24:16
Max Rectangle in Binary Matrix 350
64:11
Rod Cutting 350
78:01
Queen Attack 350
75:33
Multiply dp
Problem Score Companies Time Status
Intersecting Chords in a Circle 300
59:16
Unique Binary Search Trees II 400 24:12
Count Permutations of BST 400
83:47
Preprocess dp
Problem Score Companies Time Status
Max Rectangle in Binary Matrix 350
64:11
Dp optimized backtrack
Problem Score Companies Time Status
Word Break II 350
IBM
54:08
Tree dp
Problem Score Companies Time Status
Max Sum Path in Binary Tree 400 38:18
Breaking words
Problem Score Companies Time Status
Word Break 400
IBM
49:53
Palindrome Partitioning II 400 42:14
Scramble String 500
50:53
Click here to jump start your coding interview preparation