Algorithms-Dynamic Programming

130+ posts

Game Of Multiplicity- DP on Subsequences

Last Updated: 23 December 2025

Given an array A of n integers.A sequence B is called a subsequence of A if it can be obtained by deleting zero or more elements from A without changing the order of the r...read more

DSA

Algorithms-Dynamic Programming

Minimum cost to cut a stick of length n

Last Updated: 11 November 2025

Given a wooden stick of length n units. The stick is labeled from 0 to n. We are also given an integer array cuts[], where each element cuts[i] represents the position alo...read more

DSA

Algorithms-Dynamic Programming

Find Maximum Number of Removal Queries That Can Be Processed I

Last Updated: 29 April 2024

Given an array called arr[] and another array queries[]. You can perform an operation on arr at most once, replacing it with a subsequence of itself. Then, you process the...read more

Algorithms-Dynamic Programming

Find Winner of Flip Game II

Last Updated: 16 April 2024

Given a string currentState that contains only '+' and '-'. You and your friend take turns to flip two consecutive "++" into "--". The game ends when a person can no longe...read more

Algorithms-Dynamic Programming

Worker-Bike Assignments (Campus Bikes)

Last Updated: 23 July 2025

Given an array workers[] and bikes[], which represents position of workers and bikes on a 2D plane, the task is to assign each worker to a bike based on the shortest Manha...read more

Algorithms-Dynamic Programming

Optimal cell in matrix to collect maximum coins

Last Updated: 12 March 2024

Given an M * N matrix matrix[][], where each cell is either an obstacle '#', a coin 'C', or empty '0', the task is to choose one empty cell optimally to maximize the coins...read more

Dynamic Programming

Matrix

DSA

Algorithms-Dynamic Programming

Determine winner of game by converting two consecutive 1s to 0s

Last Updated: 23 July 2025

Given a binary string S of length N. Two players 'A' and 'B' are playing a game and at each alternate turn, the player converts two consecutive 1s to 0s. The game ends whe...read more

Strings

DSA

Algorithms-Dynamic Programming

Algorithms-Backtracking

Balls rolling in the maze

Last Updated: 23 July 2025

Given a 2D array maze[][] of size M x N, one ball is dropped in each column. The maze is open on the top and bottom sides. Each cell in the box has a diagonal wall spannin...read more

Algorithms-Dynamic Programming

Find the lexicographically smallest string by prepending characters

Last Updated: 23 July 2025

Two Players A and B are playing a game using a non-empty string S of length N having lowercase English Alphabets. The length of string S is even. Each player also has a st...read more

Picked

DSA

Algorithms-Dynamic Programming

Geeks Premier League 2023

Transform an Empty String to a Given String

Last Updated: 23 July 2025

Given a string s1 and an empty string s2, you have to transform the empty string s2 to given string s1 using the given moves. In one move, you can create a sequence of ide...read more

Strings

DSA

Algorithms-Dynamic Programming

Geeks Premier League 2023

Minimizing Total Manhattan Distances for Driver-Package Allocation

Last Updated: 21 May 2024

Given two integers n and m, where n represents delivery drivers and m represents the number of packages, Additionally, their position are also given in drivers[][] and pac...read more

Algorithms-Dynamic Programming

Geeks Premier League 2023

Maximize number of indices with prefix sum equal to 0

Last Updated: 10 April 2024

Given an array arr[] of size N, you can perform the following operation on the array any number of times: If arr[i]=0, we can replace it with any integer. Your task is to ...read more

Picked

DSA

prefix-sum

Algorithms-Dynamic Programming

Geeks Premier League 2023

Count ways to arrange integers in circle such that no two adjacent are same

Last Updated: 23 July 2025

Given 2 integers N and M, find the number of ways to arrange N integers in a circle such that every integer is in the range 0 to M-1, and no two adjacent integers are same...read more

Picked

DSA

Algorithms-Dynamic Programming

Geeks Premier League 2023

Find maximum element after K increments

Last Updated: 23 July 2025

Given an array arr[] of size N, in one operation you can increase arr[i] by 1 if arr[i] = arr[i+1]. The task is to find the maximum value of the array if you can perform t...read more

Picked

Geeks Premier League

DSA

Algorithms-Dynamic Programming

Geeks Premier League 2023

Count number of pairs of arrays (a, b) such that a[i] <= b[i]

Last Updated: 23 July 2025

Given two integers n and m, the task is to count the number of pairs of arrays (a, b) where both arrays have a length of m, contain integers between 1 and n (inclusive), a...read more

Picked

DSA

combinatorics

Algorithms-Dynamic Programming

Geeks Premier League 2023

1 2 3 4 5 6 7 8 9