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

# Tag Archives: frequency-counting

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

Given a string S and a binary string B, both of length N, the task is to check if the given string S can be… Read More

Given two strings S1 and S2, representing sentences, the task is to print both sentences after removing all words which are present in both sentences.… Read More

Given a string S consisting of N lowercase alphabets, the task is to modify the string S by replacing each character by the alphabet whose… Read More

Given a string S consisting of N lowercase alphabets, the task is to check if all the strings of at least length 2 formed by… Read More

Given a string S consisting of N lowercase alphabets, the task is to remove the characters from the string whose frequency is not a power… Read More

Given a string S of length N, the task is to find the minimum number of characters required to be removed such that every distinct… Read More

Given two strings A and B of lengths N and M respectively, the task is to find the length of the longest common subsequence that… Read More

Given two positive numbers N and M, the task is to count the number of digits that are present in both N and M. Examples:… Read More

Given a string S consisting of lowercase alphabets, the task is to check whether the given string can be rearranged such that the string can… Read More

Given an array arr[] consisting of N integers, the task is for each array element, say arr[i], is to find the number of array elements… Read More

Given an array A[] consisting of N integers and an integer K, the task is to count the minimum number of distinct elements present in… Read More

Given a string S representing a sequence of moves(L, R, U, and D) and an integer R representing the radius of a circle whose center… Read More

Given an array arr[] of size N, the task is to count the number of pairs (i, j) possible from the array such that arr[j]… Read More