InterviewBit Academy is now Scaler!
InterviewBit Academy is now Scaler Academy!

Level 7

Dynamic Programming

TUTORIALS

1. Dynamic Programming ( Dp ) Introduction :
View Tutorial
2. Dynamic Programming Examples :
View Tutorial

Dynamic Programming Problems

2d string dp
Greedy or dp
Problem Score Companies Time Status
Tushar's Birthday Bombs 200
71:37
Jump Game Array 225 40:11
Min Jumps Array 300 68:16
Matrix dp
Problem Score Companies Time Status
Kingdom War 200
51:37
Min Sum Path in Matrix 300 29:38
Dungeon Princess 300
61:39
Min Sum Path in Triangle 300
41:09
Unique Paths in a Grid 300
32:04
Max Rectangle in Binary Matrix 350
73:01
Rod Cutting 350
74:15
Queen Attack 350
70:11
Suffix / prefix dp
Problem Score Companies Time Status
Sub Matrices with sum Zero 200
67:10
Coin Sum Infinite 225
60:51
Best Time to Buy and Sell Stocks I 300 27:22
Max Product Subarray 300 61:51
Arrange II 350 66:57
Knapsack
Problem Score Companies Time Status
Tushar's Birthday Party 200 58:47
Flip Array 200
74:52
Equal Average Partition 350 78:59
Adhoc
Problem Score Companies Time Status
Best Time to Buy and Sell Stocks II 225 38:35
Derived dp
Problem Score Companies Time Status
Max Sum Without Adjacent Elements 225 55:51
Dp optimized backtrack
Problem Score Companies Time Status
Word Break II 350
IBM
59:16
Tree dp
Problem Score Companies Time Status
Max Sum Path in Binary Tree 400 52:02
Multiply dp
Problem Score Companies Time Status
Unique Binary Search Trees II 400 33:14
Count Permutations of BST 400
72:23
Breaking words
Problem Score Companies Time Status
Word Break 400
IBM
60:32
Palindrome Partitioning II 400 55:35

Additional Practice