SSk Shoyeb·Mar 18Shortest Common Supersequence DP JavaScript Code With ExplainationGiven two strings str1 and str2, return the shortest string that has both str1 and str2 as subsequences. If there are multiple valid strings, return any of them. A string s is a subsequence of string2 min read·skshoyebjavascript.hashnode.dev
SSk Shoyeb·Mar 17Print All LCS Sequence JS DP + Backtracking SolutionAll LCS sequence is a hard problem in dynamic programming. In this article we will solve this with dymanic programming approach with backtracking and2 min read·skshoyebjavascript.hashnode.dev
AAtul Kumar·Jun 12, 2025Life Lessons from the Fractional Knapsack ProblemPrioritize value, embrace partial efforts, respect limits, seize opportunities, and simplify approach learned from the Fractional Knapsack Problem5 min read·blog.devatul.site
RR. G.·May 11, 2025Dynamic Programming (An Intro)The Ladder Problem4 min read·pinkydolpgincode.hashnode.dev
SSANTOSH SINGH·Jul 20, 2024Mastering Dynamic Programming: A Guide for Aspiring ProgrammersIn this blog, I will introduce you to the basics of Dynamic Programming, its key principles, and some common problems that can be solved.4 min read·santoshsingh.hashnode.dev
VVineeth Chivukula·Jun 26, 2024Understanding Dynamic ProgrammingDynamic Programming (DP) is a powerful technique used to solve problems by breaking them down into simpler subproblems and storing the results of these subproblems to avoid redundant calculations. It is particularly effective for optimization problem...2 min read·vineethchivukula.hashnode.dev
AAtharva ·May 22, 2023Daily Dose of DSA - Day 17Palindromic Partition using Recursion + TDDP (O(n^3) TC & O(n^2) SC) , Recursion+TDDP (O(n^3)TC & O(n^2) SC),using Iteration+BUDP (O(n^3)TC & O(n)SC)7 min read·legolas12hustle.dev