# Category Archives: Dynamic Programming

Given three positive integers L, R and Y, the task is to count the numbers in the range [L, R] whose sum of digits is… Read More
Given an array arr[] consisting of N positive integers, the task is to find the length of the longest increasing subsequence possible by selecting elements… Read More
Given an array arr[] of size N, the task is to find the minimum number of array elements required to be removed from the array… Read More
Given an array arr[] consisting of N positive integers, the task is to minimize the remaining array element that can be obtained by repeatedly removing… Read More
Given a string str of length N, the task is to print all possible non-empty subsequences of the given string such that the subsequences either… Read More
Given an integer N, the task is to reduce the value of N to 0 by performing the following operations minimum number of times: Flip… Read More
Given a 2D array arr[][] of size N * M, and an integer K, the task is to select K elements with maximum possible sum… Read More
Given a string str of length N, the task is to print all possible distinct subsequences of the string str which consists of non-repeating characters… Read More
Given a sorted array arr[] of size N, the task is to check if it is possible to reach the end of the given array… Read More
Given an integer matrix mat[][] of dimensions N * M,  the task is to print the maximum product of matrix elements in the path from… Read More
Given an array A[] of size N and a positive integer K, the task is to find the length of the longest subarray such that… Read More
Given two arrays arr[] and jumps[] consisting of N positive integers, the task for each array element arr[i] is to find the minimum number of… Read More
Given two arrays arr1[] and arr2[] of length M and N consisting of digits [0, 9] representing two numbers and an integer K(K ≤ M… Read More
Given two positive integers N and K, the task is to find the number of K length strings that can be generated from the first… Read More
Given an array arr[] of size N, the task is to count the number of longest increasing subsequences present in the given array. Examples: Input:… Read More