Dynamic Programming Archives

Last Updated: 30 May 2024

Given a set of items, each with a weight and a value, and a knapsack with a maximum weight capacity, the task is to determine the maximum value that can be obtained by put...read more

Traveling Salesman Problem (TSP) in Python

Last Updated: 31 May 2024

The Traveling Salesman Problem (TSP) is a classic algorithmic problem in the fields of computer science and operations research. It involves finding the shortest possible ...read more

Number of Ways to Handshakes That Don't Cross

Last Updated: 30 May 2024

Given an even number of people n, who are standing in a circle. Each person shakes hands with one other person, resulting in a total of n/2 handshakes. The task is to find...read more

Assign Campus Bikes to Workers II

Last Updated: 11 June 2024

On a 2D grid representing a campus, there are n workers and m bikes, with 1 = n = m = 10. Each worker and bike is assigned a 2D coordinate on this grid. The tasks is to as...read more

Find the Best Sightseeing Pair

Last Updated: 31 May 2024

Given an integer array arr[] where arr[i] represents the value of the ith sightseeing spot. Two sightseeing spots i and j have a distance j - i between them. The score of ...read more

Jump Game III Problem

Last Updated: 14 June 2024

Given an array arr[] of non-negative integers size N, the task is to start from index X and check if we can reach any index with value 0. For any index i, we can jump to i...read more

Find Longest Palindromic Subsequence II

Last Updated: 09 November 2024

Given a string s, return the length of the longest good palindromic subsequence in s such that:It has an even length.No two consecutive characters are equal, except the tw...read more

Count Ways to Build House of Cards

Last Updated: 28 June 2024

Given N playing cards, the task is to return the number of distinct house of cards we can build using all N cards. A house of cards meets the following conditions:A house...read more

Minimum Amount to Paint the Walls

Last Updated: 21 August 2024

Given two 0-indexed integer arrays, cost[] and time[] of size n representing the costs and the time taken to paint n different walls respectively. There are two painters a...read more

Climbing Stairs - Count ways to reach Nth stair (Order does not matter)

Last Updated: 05 October 2024

There arenstairs, and a person standing at the bottom wants to reach the top. The person can climb either1 stair or 2 stairs at a time. Count the number of ways, the perso...read more

Dynamic Programming

Mathematical

DSA

DP Standard Problem Variations

Last Updated: 02 December 2024

When we solve Dynamic Programming problems, we try to find a pattern by matching pattern with a standard DP problem. This is generally recommended to solve new DP problems...read more

DP Problems Dimension Wise (1D, 2D and 3D)

Last Updated: 05 May 2025

When we solve a Dynamic Programming (DP) problem, we store solution in an array. The dimensions of the array are dependent on number of variables that change in recursive ...read more

Dynamic Programming

DSA

DP Problems Topic Wise

Last Updated: 13 March 2025

DP Problems on MathsFibonacci NumbersTribonacci NumbersLucas NumberBinomial CoefficientPascal's Triangle GenerationNth Row of Pascal TriangleCatalan Number Matrix Chain Mu...read more

Interview Experiences

Dynamic Programming

DSA

Dynamic Programming in Python

Last Updated: 14 February 2025

Dynamic Programming is a commonly used algorithmic technique used to optimize recursive solutions when same subproblems are called again.The core idea behind DP is to stor...read more

Dynamic Programming

Python

Python-DSA

Commonly Asked Data Structure Interview Questions on Dynamic Programming

Last Updated: 19 June 2025

Dynamic Programming (DP) is a method used to solve problems by breaking them down into simpler subproblems and solving each subproblem just once, storing the solutions for...read more

Dynamic Programming

DSA