Given a 2D array plates[][] of size N, which each row representing the length and width of a N rectangular plates, the task is to… Read More

# Tag Archives: LIS

Given two arrays firstArr[], consisting of distinct elements only, and secondArr[], the task is to find the length of LCS between these 2 arrays. Examples:… 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 count the number of longest increasing subsequences present in the given array. Examples: Input:… Read More

Given two arrays A[] and B[] consisting of N and M integers respectively, and an integer C, the task is to find the minimum cost… Read More

Given an array A[] consisting of N distinct integers and another array B[] consisting of M integers, the task is to find the minimum number… Read More

Given an array arr[] consisting of N integers, the task is to find the length of the longest increasing absolute even subsequence. An increasing absolute… Read More

Given an array arr[] consisting of N positive integers, the task is to find the length of the longest increasing subsequence consisting of Prime Numbers… Read More

Given an integer array arr[] of size N and an integer K. The task is to find length of longest subsequence whose sum is less… Read More

Given an arr[] of length N, the task is to find the length of longest Reverse Bitonic Subsequence. A subsequence is called Reverse Bitonic if… Read More

Given an array arr[] of length N with unique elements, the task is to find the length of the longest increasing subsequence that can be… Read More

Given an array A[] of size n where there can be repetitive elements in the array. We have to find the minimum concatenation required for… Read More

Given an array arr[] of size N, the task is to find the length of the longest increasing subsequence in the array formed by the… Read More

Given an array arr[] of N integers, the task is to find and print the Longest Increasing Subsequence.Examples: Input: arr[] = {12, 34, 1, 5,… Read More