Skip to content

Category Archives: Dynamic Programming

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
Given a matrix arr[][] of dimensions 2 * N, the task is to maximize the sum possible by selecting at most one element from each… Read More
Given an integer X and integer N, the task is to find the number of unique paths starting from the root in N-ary tree such… Read More
Given two arrays arr[] and arr1[] of lengths N and M respectively, the task is to find the longest increasing subsequence of array arr[] such… Read More
Given an N-array tree of N nodes, rooted at 1, with edges in the form {u, v}, and an array values[] consisting of N integers.… Read More
Given an array arr[] of size N, the task is to find the total number of sequences of positive integers possible (greater than 1) whose… Read More
Given integers N and K representing the number of batches and number of students in each batch respectively, and a 2D array ratings[][] of size… Read More