Skip to content

Tag Archives: frequency-counting

Given a binary string S of size N, the task is to find the length of the longest non-increasing subsequence in the given string S.… Read More
Given string S consisting of lowercase and uppercase letters, the task is to find the number of substrings having the equal number of lowercase and… Read More
Given an array arr[] consisting of N integers, the task is to count the number of distinct pairs (arr[i], arr[j]) in the array such that… Read More
Given a string S consisting of lowercase English alphabets, the task is to right shift each character of the given string S circularly by its… Read More
Given a string S consisting of N characters (representing the tasks to perform) and a positive integer K, the task is to find the minimum… Read More
Given a string S and a character X, the task is to generate a non-palindromic string by inserting the character X in the string S.… Read More
Given an array arr[] consisting of N integers, the task is to find the number of pairs such that the GCD of any pair of… Read More
Given a string S consisting of N lowercase alphabets, the task is to count the number of substrings whose frequency of each character is even.… Read More
Given a string S consisting of N alphabets and two positive integers L and U, representing the cost of converting any character to lowercase and… Read More
Given an array arr[] consisting of N strings, the task is to sort the array in ascending order after modifying each string by removing all… Read More
Given a string S consisting of N lowercase alphabets and an array of pairs of characters P[][2], the task is to modify the given string… Read More
Given an array arr[] consisting of N positive integers, the task is to find the LCM of all unique elements of the given array. If… Read More
Given a string S consisting of N lowercase alphabets, the task is to check if it is possible to split the string S into three… Read More
Given an integer N, the task is to check whether the given number is a pangram or not. Note: A Pangram Number contains every digit [0-… Read More
Given a binary array arr[] of size N, the task is to find the total cost required to make all array elements equal to 1,… Read More