Menu

Earn Premium with Referrals

Invite your friends and earn Premium rewards through our referral program.

See how it works and start inviting friends.

🧩 Playlist

Top Dynamic Programming Mastery Interview Questions

A structured, step-by-step roadmap designed to build pattern mastery, prioritizing the most frequently asked questions in top tech interviews.

0%

Overall Progress

0 solved / 0 total

Easy0/0
Medium0/0
Hard0/0
Climbing Stairs
Fibonacci Number
Min Cost Climbing Stairs
House Robber
Medium
Coin Change
Medium
Coin Change 2
Medium
Best Time to Buy and Sell Stock III
Arithmetic Slices
Medium
Find the Derangement of An Array
Medium
Sorting Three Groups
Medium
Minimum Cost Good Caption
Unique Paths
Medium
Unique Paths II
Medium
Minimum Path Sum
Medium
Longest Increasing Path in a Matrix
Maximal Square
Medium
Word Search
Medium
Cherry Pickup
Number of Increasing Paths in a Grid
Maximum Difference Score in a Grid
Medium
Longest Common Subsequence
Medium
Edit Distance
Longest Palindromic Subsequence
Medium
Distinct Subsequences
Word Break
Medium
Word Break II
Valid Parenthesis String
Medium
Find All Good Strings
Check if an Original String Exists Given Two Encoded Strings
Longest Ideal Subsequence
Medium
Apply Operations to Make Two Strings Equal
Medium
Number of Strings Which Can Be Rearranged to Contain Substring
Medium
Construct String with Minimum Cost
Burst Balloons
Palindrome Partitioning II
Maximum Subarray
Medium
Maximum Product Subarray
Medium
Partition Equal Subset Sum
Medium
Stone Game VII
Medium
The Score of Students Solving Math Expression
Minimum Cost to Split an Array
Check if it is Possible to Split Array
Medium
Paint House
Medium
Regular Expression Matching
Interleaving String
Medium
Longest Increasing Subsequence
Medium
Number of Longest Increasing Subsequence
Medium
Dice Roll Simulation
Number of Distinct Roll Sequences
Longest Unequal Adjacent Groups Subsequence I
Longest Unequal Adjacent Groups Subsequence II
Medium
Count Non Decreasing Arrays With Given Digit Sums
Combination Sum IV
Medium
Permutation Sequence
Unique Binary Search Trees
Medium
Unique Binary Search Trees II
Medium
Catalan Number Applications
Medium
Number of Music Playlists
Count All Valid Pickup and Delivery Options
Build Array Where You Can Find The Maximum Exactly K Comparisons
Count Ways to Build Rooms in an Ant Colony
Number of Ways to Earn Points
Medium
Count K-Reducible Numbers Less Than N
Traveling Salesperson Problem (DP)
Hard
Set Difference Sum
Hard
Minimum Score Triangulation of Polygon
Medium
Maximum Score Words Formed by Letters
Shortest Path with Alternating Colors
Medium
Maximize Score After N Operations
Minimum XOR Sum of Two Arrays
The Number of Good Subsets
Maximum Product of the Length of Two Palindromic Subsequences
Medium
Minimum Number of Lines to Cover Points
Medium
Minimum Time to Break Locks I
Medium
Lowest Common Ancestor of a Binary Tree
Medium
Lowest Common Ancestor of a Binary Search Tree
Medium
Diameter of Binary Tree
Binary Tree Maximum Path Sum
Flatten Binary Tree to Linked List
Medium
Binary Tree Cameras
Subtree Removal Game with Fibonacci Tree
Parallel Courses III
Choose Edges to Maximize Score in a Tree
Difference Between Maximum and Minimum Price Sum
Minimum Edge Weight Equilibrium Queries in a Tree
Count Visited Nodes in a Directed Graph
Maximize Sum of Weights after Edge Removals
Best Time to Buy and Sell Stock
Best Time to Buy and Sell Stock II
Medium
Best Time to Buy and Sell Stock IV
Gas Station
Medium
Can Complete Circuit
Medium
Video Stitching
Medium
Maximum Earnings From Taxi
Medium
Maximum Array Hopping Score I
Medium
Word Ladder
Word Ladder II
Shortest Path in Binary Matrix
Medium
Knight Probability in Chessboard
Medium
Out of Boundary Paths
Medium
Filling Bookcase Shelves
Medium
Maximum Profit in Job Scheduling
Constrained Subsequence Sum
Best Team With No Conflicts
Medium
Delivering Boxes from Storage to Ports
First Day Where You Have Been in All the Rooms
Minimum Total Space Wasted With K Resizing Operations
Minimum Operations to Reduce an Integer to 0
Medium
Minimum Number of Operations to Make X and Y Equal
Medium
Maximize the Number of Partitions After Operations
Toss Strange Coins
Medium
Sum Of Special Evenly-Spaced Elements In Array
Maximum Subarray Sum After One Operation
Medium
Choose Numbers From Two Arrays in Range
Minimum Costs Using the Train Line
Medium
Count Strictly Increasing Subarrays
Medium
Minimum Time to Kill All Monsters
Number of Good Binary Strings
Medium
Construct the Longest New String
Medium
Minimum Time to Make Array Sum At Most x
Minimizing Array After Replacing Pairs With Their Product
Maximum Total Reward Using Operations I
Medium
Maximum Total Reward Using Operations II