Skip to content

Category Archives: Dynamic Programming

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 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
Given a 2D matrix mat[][] of size N * M and a positive integer K, the task is to find the area of the smallest… Read More
Given an integer N, the task is to count all possible strings of length N consisting of vowels {a, e, i, o, u} that can… Read More
Given three positive integers N, X, and Y, the task is to count N-digit numbers containing of X or Y only as digits and the… Read More
Given an array, arr[] of size N, the task is to find the median of sums of all possible subsets of the given array. Examples:… Read More
Given an array arr[] consisting of N positive integers and the integers X and M, where 0 <= X < M, the task is to… Read More