Dynamic Programming

1.5k+ posts

Last Updated: 18 March 2025

Dynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we...read more

Algorithms

Dynamic Programming

DSA

Coin Change - Minimum Coins to Make Sum

Last Updated: 14 March 2025

Given an array of coins[] of size n and a target value sum, where coins[i] represent the coins of different denominations. You have an infin ...read more

Travelling Salesman Problem using Dynamic Programming

Last Updated: 26 November 2024

Given a2d matrix cost[][]ofsize nwherecost[i][j]denotes the cost of moving fromcity i to city j.The task is to complete atourfromcity 0 (0-b ...read more

Similar Topics

DSA

22.3k+ articles

Mathematical

7.7k+ articles

Arrays

6.4k+ articles

Strings

3.2k+ articles

Competitive Programming

2.3k+ articles

Algorithms

1.9k+ articles

Matrix

1.2k+ articles

Recursion

1k+ articles

Combinatorial

690+ articles

subsequence

420+ articles

Subset Sum Problem

Last Updated: 15 March 2025

Given an array arr[] of non-negative integers and a value sum, the task is to check if there is a subset of the given array whose sum is equ...read more

Bellman–Ford Algorithm

Last Updated: 14 April 2025

Given a weighted graph with V vertices and E edges, along with a source vertex src, the task is to compute the shortest distances from the s...read more

Longest Palindromic Substring

Last Updated: 10 March 2025

Given a string s, the task is to find the longest substring which is a palindrome. If there are multiple answers, then return the first appe ...read more

Sieve of Eratosthenes

Last Updated: 17 March 2025

Given a number n, print all primes smaller than or equal to n. It is also given that n is a small number.Examples:Input: n = 10Output: 2 3 5...read more

Floyd Warshall Algorithm

Last Updated: 16 April 2025

Given a matrix dist[][] of size n x n, where dist[i][j] represents the weight of the edge from node i to node j. If there is no direct edge,...read more

Last Updated: 12 March 2025

Given n items where each item has some weight and profit associated with it and also given a bag with capacity W, [i.e., the bag can hold at...read more

Matrix Chain Multiplication

Last Updated: 22 March 2025

Given the dimension of a sequence of matrices in an array arr[], where the dimension of the ith matrix is (arr[i-1] * arr[i]), the task is t...read more

matrix-chain-multiplication

DSA

Coin Change - Count Ways to Make Sum

Last Updated: 27 April 2025

Given an integerarray of coins[] of size nrepresenting different types of denominations and an integer sum, the task is to count all combina...read more

Longest Common Subsequence (LCS)

Last Updated: 04 March 2025

Given two strings, s1 and s2, the task is to find the length of the Longest Common Subsequence. If there is nocommon subsequence, return0. A...read more

Longest Increasing Subsequence (LIS)

Last Updated: 03 March 2025

Given an array arr[] of size n, the task is to find the length of the Longest Increasing Subsequence (LIS) i.e., the longest possible subseq...read more

Last Updated: 15 April 2025

Given a positive integer n, the task is to find the nth Fibonacci number.The Fibonacci sequence is a sequence where the next term is the sum ...read more

matrix-exponentiation

DSA

Maximum Subarray Sum - Kadane's Algorithm

Last Updated: 28 February 2025

Given an array arr[], the task is to find the subarray that has the maximum sum and return its sum.Examples:Input: arr[] = {2, 3, -8, 7, -1,...read more

1 2 3 4 5 6 7 8 >>

1 2 3 4 5 6 >>

1 2 3 4 >>