Tag Archives: subsequence

There are some processes that need to be executed. The amount of load that process causes a server that runs it, is being represented by… Read More
String matching algorithms have greatly influenced computer science and play an essential role in various real-world problems. It helps in performing time-efficient tasks in multiple… Read More
Given an array arr[] having N integers. The task is to determine if the array can be partitioned into 3 subsequences of an equal sum… Read More
Given an array arr[] of size N, the task is to print the longest bitonic subsequence of the given array.Note: If more than one solution… Read More
Given two integers N and K, the task is to generate all positive integers with length N having an absolute difference of adjacent digits equal… Read More
Given a numeric string S, the task is to find the maximum length of a subsequence having its left rotation equal to its right rotation.… Read More
Given an array arr[] of N positive integers. The task is to find the length of the shortest sub-sequence such that the GCD of the… Read More
Given a string S, the task is to find the count of maximum occurring subsequence P from S using only those characters whose indexes are… Read More
Given an array arr[] of N integers, where N is an even number. The task is to divide the given N integers into two equals… Read More
Given an array of N distinct integers. For each lement the task is to find the count of subsequence from all the possible subsequence whose… Read More
Given an array a[] consisting of N integers, the task is to perform the following operations:   Select a subsequence and for every pth element of… Read More
Given a binary array arr[], the task is to find the maximum possible length of non-decreasing subsequence that can be generated by reversing a subarray… Read More
Given an array of strings arr[], the task is to find the maximum possible length of a string of distinct characters that can be generated… Read More
Given a numeric string s consisting of digits 0 to 9, the task is to find the length of the largest subsequence consisting of a… Read More
Given an array arr[] consisting of N integers, the task is to find the maximum count of decreasing subsequences possible from an array which satisfies… Read More