Tag Archives: frequency-counting

Given two binary strings A and B of length N, the task is to check if the string A can be converted to B by… Read More
Given an array arr[] of size N and an integer K, the task is to find the count of distinct pairs in the array whose… Read More
Given two arrays, arr[] and brr[] of size N and M respectively, the task is to find the count of pairs (arr[i], brr[j]) such that… Read More
Given an array arr[] of size N and an integer T representing the count of threads, the task is to find all non-repeating array elements… Read More
Given an array of strings arr[], the task is to find the count of distinct strings present in the array using polynomial rolling hash function.… Read More
Given an array arr[] of size N, the task is to find the maximum frequency of any array element by incrementing or decrementing each array… Read More
Given an array arr[] of size N, the task is to find the minimum count of array elements required to be removed such that frequency… Read More
Given an array of equal-length strings, arr[] of size N, the task is to check if all the strings can be made equal by repeatedly… Read More
Given a string S consisting of ‘X’, ‘Y’ and ‘Z’ only, the task is to convert S to a string consisting of only a single… Read More
Given an array of strings arr[], the task is to print all unique strings that are present in the given array. Examples: Input: arr[] =… Read More
Given an integer target and an array arr[] consisting of N positive integers where arr[i] denotes the time required to score 1 point for the… Read More
Given an array arr[] consisting of N integers, the task is to count ways to split array into two subarrays of equal sum by changing… Read More
Given a string str, the task is to find the maximum count of common non-repeating characters that can be obtained by partitioning the given string… Read More
Given an array arr[] of size N, the task is to find the largest non-repeating element present in the given array. If no such element… Read More
Given an array arr[] of size N, the task is to check if any subarray from the given array can be made a palindrome by… Read More