Skip to content

Tag Archives: frequency-counting

Given a binary string S of length N, the task is to print the minimum number of indices, substrings consisting only of 1s are required… Read More
Given a binary array arr[], the task is to count the number of subarrays having equal count of 0s and 1s, and all the 0s… Read More
Given an array arr[] of size N, the task is to find the frequency of each distinct element present in the given array. Examples: Input:… Read More
Given an array arr[] consisitng of a permutation of first N natural numbers, the task is to find the minimum number of clockwise circular rotations… Read More
Given an array arr[] representing burst time of N processes scheduled using the Round Robin Algorithm with given quantum time Q. Assuming that all the… Read More
Given an array arr[] of size N, the task is to print the minimum count of equal length subsets the array can be partitioned into… Read More
Given two strings A and B of length N and M respectively, the task is to find the minimum cost to convert string A to… Read More
Given an array position[] consisting of N integers where position[i] denotes the position of the ith element, the task is to find the minimum cost… Read More
Given string str consisting of lowercase letters, the task is to find the maximum number of non-overlapping substrings such that each substring contains all occurrences… Read More
Given string str, the task is to find the minimum count of characters that need to be deleted from the string such that the frequency… Read More
Given a string S and an integer K, the task is to generate lexicographically the largest string possible from the given string, by removing characters… Read More
Given binary string str, the task is to find the minimum number of characters required to be flipped to make all 1s in right and… Read More
Given an array arr[] consisting of N strings, the task is to modify the array by replacing the duplicate strings by appending ay number such… Read More