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:15
Jump Game Array 225 29:51
Min Jumps Array 300 54:18
Suffix / prefix dp
Problem Score Companies Time Status
Sub Matrices with sum Zero 200
76:22
Coin Sum Infinite 225
53:36
Best Time to Buy and Sell Stocks I 300 22:19
Max Product Subarray 300 48:17
Arrange II 350 74:10
Knapsack
Problem Score Companies Time Status
N digit numbers with digit sum S 200
57:59
Tushar's Birthday Party 200 65:14
Flip Array 200
77:38
Equal Average Partition 350 84:15
Adhoc
Problem Score Companies Time Status
Best Time to Buy and Sell Stocks II 225 29:05
Largest area of rectangle with permutations 650
60:03
Derived dp
Problem Score Companies Time Status
Max Sum Without Adjacent Elements 225 44:23
2d string dp
Matrix dp
Problem Score Companies Time Status
Min Sum Path in Matrix 300 23:07
Dungeon Princess 300
56:27
Min Sum Path in Triangle 300
32:49
Unique Paths in a Grid 300
24:43
Max Rectangle in Binary Matrix 350
63:38
Rod Cutting 350
78:22
Queen Attack 350
77:18
Multiply dp
Problem Score Companies Time Status
Intersecting Chords in a Circle 300
60:22
Unique Binary Search Trees II 400 24:35
Count Permutations of BST 400
86:22
Preprocess dp
Problem Score Companies Time Status
Max Rectangle in Binary Matrix 350
63:38
Dp optimized backtrack
Problem Score Companies Time Status
Word Break II 350
IBM
55:31
Tree dp
Problem Score Companies Time Status
Max Sum Path in Binary Tree 400 38:20
Breaking words
Problem Score Companies Time Status
Word Break 400
IBM
50:18
Palindrome Partitioning II 400 42:59
Scramble String 500
53:46
Click here to start solving coding interview questions