Skip to content

Tag Archives: subsequence

Given an array arr[] of N integers. The task is to find the length of the contiguous strictly decreasing sequence that can be derived after… Read More
Given two strings A and B consists of lowercase letters, the task to find the minimum number of subsequence required to form A from B.… Read More
Given an array arr[] of size N and a number K, the task is to find the length of the smallest subsequence such that the… Read More
Given an array arr[] consisting of integers of length N and an integer K (1 ≤ k ≤ N), the task is to find the… Read More
Given two strings A and B consisting of only lowercase letters, the task is to find the minimum number of subsequences required from A to… Read More
For a given distinct integer sequence of size N, the task is to count the number of contiguous increasing subsequence and contiguous decreasing subsequence in… Read More
Given a string str, the task is to find the maximum length K such that there exist two sub-sequences A and B each of length… Read More
Given an array arr[] of length N, the task is to find the number of strictly increasing sub-sequences in the given array. Examples:   Input: arr[]… Read More
Given a binary string S of length N, the task is to find the length of the longest sub-sequence in it which is divisible by… Read More
Given an array arr[] of N integers, the task is to find the count of all the subsequences of the array that have the positive… Read More
Given binary string str of length N, the task is to find the count of subsequences of str which are divisible by 2. Leading zeros… Read More
Given a string S of length N and an integer K, the task is to find the length of longest sub-sequence such that the difference… Read More
Given an array arr, the task is to find the length of The Longest Increasing Sequence using Binary Indexed Tree (BIT)  Examples:  Input: arr =… Read More
A sequence of positive real numbers S1, S2, S3, …, SN is called a superincreasing sequence if every element of the sequence is greater than… Read More
Given two arrays S[] and T[] of size N and M respectively. The task is to find the pairs of subsequences of S[] and subsequences… Read More

Start Your Coding Journey Now!