---
title: "#dp articles | Hashnode"
description: "Explore 7 articles tagged #dp on Hashnode. Tutorials, guides, and how-tos from the community."
url: "https://hashnode.com/tag/dp"
---

Tag

# #dp

7 posts · 1 followers

[Sk Shoyeb](https://hashnode.com/@skshoyebjs) · [Mar 18](https://hashnode.com/posts/shortest-common-supersequence-dp-javascript-code-with-explaination/69ba4813c22d3eeb8a43e40d)

### [Shortest Common Supersequence DP JavaScript Code With Explaination](https://skshoyebjavascript.hashnode.dev/shortest-common-supersequence-dp-javascript-code-with-explaination?utm_source=hashnode&utm_medium=feed)

Given 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 string

2 min read · [skshoyebjavascript.hashnode.dev](https://skshoyebjavascript.hashnode.dev/shortest-common-supersequence-dp-javascript-code-with-explaination?utm_source=hashnode&utm_medium=feed)

[Sk Shoyeb](https://hashnode.com/@skshoyebjs) · [Mar 17](https://hashnode.com/posts/print-all-lcs-sequence-js-dp-backtracking-solution/69b907a03cc3ab373f8194c9)

### [Print All LCS Sequence JS DP + Backtracking Solution](https://skshoyebjavascript.hashnode.dev/print-all-lcs-sequence-js-dp-backtracking-solution?utm_source=hashnode&utm_medium=feed)

All LCS sequence is a hard problem in dynamic programming. In this article we will solve this with dymanic programming approach with backtracking and

2 min read · [skshoyebjavascript.hashnode.dev](https://skshoyebjavascript.hashnode.dev/print-all-lcs-sequence-js-dp-backtracking-solution?utm_source=hashnode&utm_medium=feed)

[Atul Kumar](https://hashnode.com/@theatulanand) · [Jun 12, 2025](https://hashnode.com/posts/life-lessons-from-the-fractional-knapsack-problem/684b2d614ee6394d84257ab9)

### [Life Lessons from the Fractional Knapsack Problem](https://blog.devatul.site/life-lessons-from-the-fractional-knapsack-problem?utm_source=hashnode&utm_medium=feed)

Prioritize value, embrace partial efforts, respect limits, seize opportunities, and simplify approach learned from the Fractional Knapsack Problem

5 min read · [blog.devatul.site](https://blog.devatul.site/life-lessons-from-the-fractional-knapsack-problem?utm_source=hashnode&utm_medium=feed)

[R. G.](https://hashnode.com/@pinkydolphin) · [May 11, 2025](https://hashnode.com/posts/dynamic-programming-an-intro/68210f387651700d1adc9dc8)

### [Dynamic Programming (An Intro)](https://pinkydolpgincode.hashnode.dev/dynamic-programming-an-intro?utm_source=hashnode&utm_medium=feed)

The Ladder Problem

4 min read · [pinkydolpgincode.hashnode.dev](https://pinkydolpgincode.hashnode.dev/dynamic-programming-an-intro?utm_source=hashnode&utm_medium=feed)

[SANTOSH SINGH](https://hashnode.com/@sansi28) · [Jul 20, 2024](https://hashnode.com/posts/mastering-dynamic-programming-a-guide-for-aspiring-programmers/669c0677dd1e6b0f12639c8a)

### [Mastering Dynamic Programming: A Guide for Aspiring Programmers](https://santoshsingh.hashnode.dev/mastering-dynamic-programming-a-guide-for-aspiring-programmers?utm_source=hashnode&utm_medium=feed)

In 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](https://santoshsingh.hashnode.dev/mastering-dynamic-programming-a-guide-for-aspiring-programmers?utm_source=hashnode&utm_medium=feed)

[Vineeth Chivukula](https://hashnode.com/@vineethchivukula) · [Jun 26, 2024](https://hashnode.com/posts/understanding-dynamic-programming/667b7a84fadbdde0b0b04332)

### [Understanding Dynamic Programming](https://vineethchivukula.hashnode.dev/understanding-dynamic-programming?utm_source=hashnode&utm_medium=feed)

Dynamic 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](https://vineethchivukula.hashnode.dev/understanding-dynamic-programming?utm_source=hashnode&utm_medium=feed)

[Atharva](https://hashnode.com/@Legolas12) · [May 22, 2023](https://hashnode.com/posts/daily-dose-of-dsa-day-17/646b5b8b1c671fec14174e2f)

### [Daily Dose of DSA - Day 17](https://legolas12hustle.dev/daily-dose-of-dsa-day-17?utm_source=hashnode&utm_medium=feed)

Palindromic 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](https://legolas12hustle.dev/daily-dose-of-dsa-day-17?utm_source=hashnode&utm_medium=feed)
