Dynamic Programming (DP) is defined as a technique that solves some particular type of problems in Polynomial Time. Dynamic Programming solutions are faster than the… Read More

# Tag Archives: Algorithms-Dynamic Programming

Given a complete graph having N nodes and N*(N-1)/2 edges and a positive integer K, the task is to find the number of ways if… Read More

Given an integer N and a 2D array cost[][3], where cost[i][0], cost[i][1], and cost[i][2] is the cost of painting ith house with colors red, blue,… Read More

Given three integers N, A, and B, the task is to calculate the probability that the sum of numbers obtained on throwing the dice exactly… Read More

Given an array arr[] of N positive integers. The task is to find the length of the shortest sub-sequence such that the GCD of the… Read More

Give an integer N, the task is to find the minimum number of moves to reduce N to 0 by one of the following operations:… Read More

Given a string S, the task is to find the count of maximum occurring subsequence P from S using only those characters whose indexes are… Read More

Given a number N, the task is to find the number of ways in which the integer N can be represented as a sum of… Read More

Given a string S of length N which only contains lowercase alphabets. Find the length of the longest substring of S such that the characters… Read More

Given a tree with N nodes value from 1 to N and (N – 1) Edges and a number K, the task is to remove… Read More

Given N number of envelopes, as {W, H} pair, where W as the width and H as the height. One envelope can fit into another… Read More

Given a matrix mat[][] with N rows and M columns. The task is to find the minimum number of changes required in the matrix such… Read More

Given an array arr[] of N positive integers, the task is to find the largest strictly increasing subsequence of arr[] such that the indices of… Read More