Given a string str with uppercase characters and an integer K, the task is to find the length of the longest subsequence such that the frequency of first K alphabets is same.
Input: str = “ACAABCCAB”, K=3
Explanation: One of the possible subsequences is “ACABCB”.
Input: str = “ACAABCCAB”, K=4
Explanation: Since, the string does not contain ‘D’, no such subsequence can be obtained.
Traverse the string and find the least frequent of the first K alphabets. Once found, (frequency of that element) * K gives the desired result.
Below is the implementation of the above approach:
- Length of longest Palindromic Subsequence of even length with no two adjacent characters same
- Longest Increasing Subsequence using Longest Common Subsequence Algorithm
- Longest substring of vowels with no two adjacent alphabets same
- Longest subsequence of a number having same left and right rotation
- Count lexicographically increasing K-length strings possible from first N alphabets
- Length of longest subsequence in an Array having all elements as Nude Numbers
- Length of longest subsequence having absolute difference of all pairs divisible by K
- Length of longest subsequence having sum of digits of each element as a Composite Number
- Check if frequency of character in one string is a factor or multiple of frequency of same character in other string
- Count of Binary Strings of length N such that frequency of 1's exceeds frequency of 0's
- Maximum length prefix such that frequency of each character is atmost number of characters with minimum frequency
- Longest Even Length Substring such that Sum of First and Second Half is same
- For each lowercase English alphabet find the count of strings having these alphabets
- Find the longest subsequence of an array having LCM at most K
- Count of Substrings with at least K pairwise Distinct Characters having same Frequency
- Longest sub-string having frequency of each character less than equal to k
- Longest subsequence such that every element in the subsequence is formed by multiplying previous element with a prime
- Count of character pairs at same distance as in English alphabets
- Remove consecutive alphabets which are in same case
- Find length of longest subsequence of one string which is substring of another string
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.