Skip to content
/ LeetCode-Top-50-DP-Solutions Public

A curated collection of the Top 50 Dynamic Programming problems from LeetCode, solved in Python. Each file includes a clean, optimized solution to help strengthen core DP concepts like recursion, memoization, tabulation, and space optimization. Perfect for interview prep and mastering DP patterns.

License

MIT license
1 star 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

Adit-Mugdha-das/LeetCode-Top-50-DP-Solutions

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

17 Commits
01-Climbing Stairs.py
01-Climbing Stairs.py
 
 
02-Fibonacci Number.py
02-Fibonacci Number.py
 
 
03-N-th Tribonacci Number.py
03-N-th Tribonacci Number.py
 
 
04-Min Cost Climbing Stairs.py
04-Min Cost Climbing Stairs.py
 
 
05-House Robber.py
05-House Robber.py
 
 
06-Delete and Earn.py
06-Delete and Earn.py
 
 
07-Unique Paths.py
07-Unique Paths.py
 
 
08-Minimum Path Sum.py
08-Minimum Path Sum.py
 
 
09-Unique Paths II.py
09-Unique Paths II.py
 
 
10-Triangle.py
10-Triangle.py
 
 
11-Minimum Falling Path Sum.py
11-Minimum Falling Path Sum.py
 
 
12-Maximal Square.py
12-Maximal Square.py
 
 
13-Longest Palindromic Substring.py
13-Longest Palindromic Substring.py
 
 
14- Word Break.py
14- Word Break.py
 
 
15-Longest Palindromic Subsequence.py
15-Longest Palindromic Subsequence.py
 
 
16-Edit Distance.py
16-Edit Distance.py
 
 
17-Minimum ASCII Delete Sum for Two Strings.py
17-Minimum ASCII Delete Sum for Two Strings.py
 
 
18-Distinct Subsequences.py
18-Distinct Subsequences.py
 
 
19- Longest Increasing Subsequence.py
19- Longest Increasing Subsequence.py
 
 
20-Number of Longest Increasing Subsequence.py
20-Number of Longest Increasing Subsequence.py
 
 
21-Maximum Length of Pair Chain.py
21-Maximum Length of Pair Chain.py
 
 
22- Longest Arithmetic Subsequence of Given Difference.py
22- Longest Arithmetic Subsequence of Given Difference.py
 
 
23-Longest Arithmetic Subsequence.py
23-Longest Arithmetic Subsequence.py
 
 
24-Russian Doll Envelopes.py
24-Russian Doll Envelopes.py
 
 
25-Find the Longest Valid Obstacle Course at Each Position.py
25-Find the Longest Valid Obstacle Course at Each Position.py
 
 
26-Longest Common Subsequence.py
26-Longest Common Subsequence.py
 
 
27-Uncrossed Lines.py
27-Uncrossed Lines.py
 
 
28-Minimum Insertion Steps to Make a String Palindrome.py
28-Minimum Insertion Steps to Make a String Palindrome.py
 
 
29-Best Time to Buy and Sell Stock with Cooldown.py
29-Best Time to Buy and Sell Stock with Cooldown.py
 
 
30-Best Time to Buy and Sell Stock with Transaction Fee.py
30-Best Time to Buy and Sell Stock with Transaction Fee.py
 
 
31- Best Time to Buy and Sell Stock III.py
31- Best Time to Buy and Sell Stock III.py
 
 
32-Best Time to Buy and Sell Stock IV.py
32-Best Time to Buy and Sell Stock IV.py
 
 
33-Unique Binary Search Trees.py
33-Unique Binary Search Trees.py
 
 
34-Unique Binary Search Trees II.py
34-Unique Binary Search Trees II.py
 
 
35-House Robber III.py
35-House Robber III.py
 
 
36-Binary Tree Maximum Path Sum.py
36-Binary Tree Maximum Path Sum.py
 
 
37-Perfect Squares.py
37-Perfect Squares.py
 
 
38-Coin Change II.py
38-Coin Change II.py
 
 
39-Combination Sum IV.py
39-Combination Sum IV.py
 
 
40-Ones and Zeroes.py
40-Ones and Zeroes.py
 
 
41-Solving Questions With Brainpower.py
41-Solving Questions With Brainpower.py
 
 
42-Coin Change.py
42-Coin Change.py
 
 
43-Count Ways To Build Good Strings.py
43-Count Ways To Build Good Strings.py
 
 
44-Decode Ways.py
44-Decode Ways.py
 
 
45-Minimum Cost For Tickets.py
45-Minimum Cost For Tickets.py
 
 
46-Domino and Tromino Tiling.py
46-Domino and Tromino Tiling.py
 
 
LICENSE
LICENSE
 
 
README.md
README.md
 
 

Repository files navigation

Hi there , I am Mugdha!

Welcome to my repository of LeetCode Top 50 Dynamic Programming Solutions – a personal collection of Python solutions to help you (and me!) master one of the most fundamental areas in algorithmic problem solving.

LeetCode Top 50 Dynamic Programming Solutions

This repository contains my Python solutions to the Top 50 Dynamic Programming problems from LeetCode’s official study plan.
It covers a broad range of essential DP patterns used in interviews at top tech companies.

Each solution is clean, optimized, and structured for easy understanding and revision.

Topics Covered

  • Fibonacci Style
  • Matrix DP
  • On Strings
  • Longest Increasing Subsequence
  • Longest Common Subsequence
  • Best Time to Buy & Sell Stock / State Machine
  • On Trees
  • Knapsack (0/1)
  • General 1D DP

Project Structure

  • Each problem is saved in a separate .py file.
  • File names follow the format: ##-Problem Title.py
  • Example: 01-Climbing Stairs.py

Language

All solutions are written in Python 3, with comments and clear logic where needed.

Solved By

Adit Mugdha Das
B.Sc. in Computer Science & Engineering
Khulna University of Engineering & Technology (KUET)
GitHub: github.com/Adit-Mugdha-das
LeetCode: leetcode.com/Mugdha_118

If this repository helped you or inspired you, don’t forget to star it!

About

A curated collection of the Top 50 Dynamic Programming problems from LeetCode, solved in Python. Each file includes a clean, optimized solution to help strengthen core DP concepts like recursion, memoization, tabulation, and space optimization. Perfect for interview prep and mastering DP patterns.

Topics

python dynamic-programming

Resources

Readme

License

MIT license
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages