## Count sub-arrays whose product is divisible by k

Given an integer K and an array arr[], the task is to count all the sub-arrays whose product is divisible by K. Examples: Input: arr[]… Read More »

- Count pairs in array whose sum is divisible by K
- Find minimum difference between any two elements | Set 2
- Count sub-arrays whose product is divisible by k
- Queries to check if string B exists as substring in string A
- Count of pairs of strings which differ in exactly one position
- Minimum cost to modify a string
- Count all elements in the array which appears at least K times after their first occurrence
- Count number of distinct substrings of a given length
- Maximize the number of sum pairs which are divisible by K
- Sum of all odd frequency nodes of the Linked List
- Number of subarrays having sum of the form k^m, m >= 0
- Rearrange given string to maximize the occurrence of string t
- Number of pairs from the first N natural numbers whose sum is divisible by K
- Maximum count of pairs which generate the same sum
- Number of ways in which the substring in range [L, R] can be formed using characters out of the range
- Total distinct pairs of ugly numbers from two arrays
- Print all the sum pairs which occur maximum number of times
- Number of times the given string occurs in the array in the range [l, r]
- Count pairs with average present in the same array
- Total character pairs from two strings, with equal number of set bits in their ascii value
- Check if a given number divides the sum of the factorials of its digits
- Distinct pairs from given arrays (a[i], b[j]) such that (a[i] + b[j]) is a Fibonacci number
- Total distinct pairs from two arrays such that second number can be obtained by inverting bits of first

Given an integer K and an array arr[], the task is to count all the sub-arrays whose product is divisible by K. Examples: Input: arr[]… Read More »

Given an array arr[], the task is to count maximum count of pairs which give the same sum. Examples: Input: arr[] = {1, 2, 3,… Read More »

Given the integer values of N and K. The task is to find the number of pairs from the set of natural numbers up to… Read More »

Given an array A[] and positive integer K, the task is to count total number of pairs in the array whose sum is divisible by… Read More »

Given an array of N integers and an integer K. The task is to print the maximum number of pairs(a[i]+a[j]) possible which are divisible by… Read More »

Given an array arr[] of N distinct integers. The task is to find the sum of two array integers a[i] + a[j] which occurs maximum… Read More »

Given two strings s1 and s2. The task is to take one character from first string and one character from second string and check if… Read More »

Given an array arr[] of N integer elements and an integer K. The task is to count all distinct arr[i] such that arr[i] appears at… Read More »

Given N bracket sequences, the task is to find the number of pairs of bracket sequences by joining which can be obtained a balanced bracket… Read More »

Given an array of integers arr[], the task is to count all the pairs (arr[i], arr[j]) such that i + j = arr[i] + arr[j]… Read More »

Given an array arr[], the task is to find the sum of all those elements from the given array whose square root is present in… Read More »

Merkle tree also known as hash tree is a data structure used for data verification and synchronization. It is a tree data structure where each… Read More »

Given a string containing lowercase English alphabets. The task is to find the minimum number of characters needed to be removed so that the remaining… Read More »

Given an array A[] of integers. The task is to print all indices of this array such that after removing the ith element from the… Read More »

Given an array of integers and an integer . For every integer of the array a[i], the task is to calculate the count of numbers… Read More »