The Jump pointer algorithm is a design technique for parallel algorithms that operate on pointer structures, such as arrays or linked list. This algorithm is… Read More

# Category Archives: Dynamic Programming

Given N number of students sitting in a line and each of them is having marks they got scored in the exam. The task is… Read More

The Coin Change Problem is considered by many to be essential to understanding the paradigm of programming known as Dynamic Programming. The two often are… Read More

Given N boxes of unit dimension, i.e. (1×1 ). The task is to find the total number of different staircases that can be made from those… Read More

Given a m x n matrix of positive integers. The task is to find the number of paths from the top left of the matrix… Read More

Given a number N, the task is to find the number of ways N can be partitioned, i.e. the number of ways that N can… Read More

Given an array of integers of size N, you have to divide it into the minimum number of “strictly increasing subsequences” For example: let the sequence… Read More

Given an array of n sizes, it includes the cost of sweets in such a way that that sweet[i] is the cost of i sweets.… Read More

Given a matrix, the task is to find the cost of the minimum path which is odd to reach the bottom of a matrix. If… Read More

Given an array A having N elements and two integers L and R where, and . You can choose any element of the array (let’s say ax)… Read More

Given a two-dimensional matrix, in how way can someone traverse it from top-left to bottom-right? Condition- At any particular cell the possible moves are either down… Read More

Given a sequence of matrices, find the most efficient way to multiply these matrices together. The problem is not actually to perform the multiplications, but… Read More

Given a number N and a sum S, find the count of numbers upto N that have digit sum equal to S. Examples: Input :… Read More

Given two string S and Q. The task is to count the number of the common subsequence in S and T. Examples: Input : S… Read More

Given a number N, we have to find the minimum number of palindromes required to express N as a sum of them. Examples: Input : N… Read More