Skip to content

✨ Added Dynamic Programming problems (Basic, 1D/2D, Advanced) - #291

Merged
HarshitPachori merged 2 commits into
HarshitPachori:mainfrom
KartikeyaGupta05:add-dp-problems
Oct 30, 2025
Merged

HarshitPachori merged 2 commits into
HarshitPachori:mainfrom
KartikeyaGupta05:add-dp-problems

Conversation

@KartikeyaGupta05

Copy link
Copy Markdown
Contributor

✅ Description

Added complete set of Dynamic Programming problems in Java with detailed explanations, examples, time & space complexities, and LeetCode links.


🔗 Related Issue

Fixes #262


🛠️ Approach / Changes Made

  • Added Basic DP problems: Fibonacci, Climbing Stairs, Min Cost, House Robber
  • Added 1D / 2D DP problems: Unique Paths, Coin Change, LIS, etc.
  • Added Advanced DP problems: 0/1 Knapsack, Subset Sum, LCS, Edit Distance, Longest Palindromic Subsequence
  • Structured and commented all problems in uniform format for readability

📸 Screenshots / Videos

N/A.


✅ Checklist

  • Code follows project guidelines
  • Tested locally and outputs verified
  • Documentation/comments included
  • Linked related issue

💬 Additional Notes

This PR expands the DSA Java section by including all essential DP problems used in interviews and coding competitions.

@github-actions

Copy link
Copy Markdown

🧩 PR Checklist

Hi @KartikeyaGupta05, before merging please ensure:

  • Updated contributor.md
  • Added proper commit message
  • Verified build/test success ✅

@github-actions

Copy link
Copy Markdown

⚠️ @KartikeyaGupta05, please add your details to the contributor.md file before merging. 🙏

@github-actions

Copy link
Copy Markdown

⭐ Hey @KartikeyaGupta05, if you like this project, don't forget to star the repository! 🚀

@HarshitPachori
HarshitPachori merged commit 1b80183 into HarshitPachori:main Oct 30, 2025
1 check passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Projects

None yet

Development

Successfully merging this pull request may close these issues.

Add Dynamic Programming (DP) Questions in DSA (Java Section)

2 participants