Merge pull request #98 from Bib3k4u/dp_pattern

added important pattern questions on DP #95

DP_Important_Pattern/DP_Question.txt

@@ -0,0 +1,50 @@
+Hello EveryOne,
+As we know that DP (Dynamic Programming) is Important concept to learn and Master for Technical Assesment and also for Interview.
+
+In an endeavor to facilitate your journey towards mastering the intricacies of dynamic programming,
+I have  created this text file. Within its digital confines lie a treasure trove of questions
+designed to sharpen your DP skills, accompanied by practice links to aid your comprehension and reinforce your understanding.
+Whether you're a novice seeking to delve into the world of dynamic programming or a seasoned coder aiming to refine your expertise,
+this resource is your compass on this intellectual voyage. 
+Embark on this DP adventure, armed with the knowledge and practice you need to conquer complex problems with elegance and efficiency.
+These questions are from NEETCODE practice set.
+
+
+Here are the questions with their practice links on LEETCODE:
+I have Divided the problem into 2 Categories.
+
+
+Questions on
+1-Dimensional DP:
+
+Climbing Stairs : https://leetcode.com/problems/climbing-stairs/
+Min Cost Climbing Stairs : https://leetcode.com/problems/min-cost-climbing-stairs/
+House Robber : https://leetcode.com/problems/house-robber/
+House Robber- II : https://leetcode.com/problems/house-robber-ii/
+Longest Palindromic Substring: https://leetcode.com/problems/longest-palindromic-substring/
+Palindromic Substrings: https://leetcode.com/problems/palindromic-substrings/
+Decode Ways: https://leetcode.com/problems/decode-ways/
+Coin Change: https://leetcode.com/problems/coin-change/description/
+Maximum Product Subarray: https://leetcode.com/problems/maximum-product-subarray/
+Word Break: https://leetcode.com/problems/word-break/
+Longest Increasing Subsequence: https://leetcode.com/problems/longest-increasing-subsequence/description/
+Partition Equal Subset Sum: https://leetcode.com/problems/partition-equal-subset-sum/description/
+
+
+Questions on
+2-Dimensional DP:
+
+Unique Paths: https://leetcode.com/problems/unique-paths/
+Longest Common Subsequence: https://leetcode.com/problems/longest-common-subsequence/
+Best Time to Buy And Sell Stock With Cooldown: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/
+Coin Change II: https://leetcode.com/problems/coin-change-ii/
+Target Sum: https://leetcode.com/problems/target-sum/
+Interleaving String: https://leetcode.com/problems/interleaving-string/description/
+Longest Increasing Path In a Matrix: https://leetcode.com/problems/longest-increasing-path-in-a-matrix/
+Distinct Subsequences: https://leetcode.com/problems/distinct-subsequences/
+Edit Distance: https://leetcode.com/problems/edit-distance/
+Burst Balloons: https://leetcode.com/problems/burst-balloons/
+Regular Expression Matching: https://leetcode.com/problems/regular-expression-matching/
+
+
+