dp Archives - Only Code

Finding the Actual Longest Common Subsequence from Dynamic Programming Table

It aims to find the longest subsequence present in both input sequences, where a subsequence is a sequence that appears in the same relative order but not necessarily consecutively.

Dynamic Programming

Finding Permutations that Form the Sum | Coin Change Permutation

Find the number of permutations to form the target sum using the elements of the given array, with repetition allowed.

Competitive Programming, Dynamic Programming

Travelling Salesman Problem using Held-Karp Algorithm | Dynamic Programming

The Held-Karp algorithm is an efficient dynamic programming approach for solving the Travelling Salesman Problem (TSP). The algorithm builds up a table to store the optimal cost of visiting subsets of cities.

Algorithms, Dynamic Programming, Graphs

Assembly-Line Scheduling

Assembly line scheduling is a classic problem in production optimization, often encountered in manufacturing industries.

Dynamic Programming