## Count of subarrays of size K having at least one pair with absolute difference divisible by K-1

Given an arr[] consisting of N elements, the task is to count all subarrays of size K having atleast one pair whose absolute difference is… Read More »

- Make A, B and C equal by adding total value N to them
- Count numbers in a range with digit sum divisible by K having first and last digit different
- Find the Kth number which is not divisible by N
- Maximum splits in binary string such that each substring is divisible by given odd number
- Product of all sorted subsets of size K using elements whose index divide K completely
- Length of longest increasing index dividing subsequence
- Split a number as sum of K numbers which are not divisible by K
- Sum of all N digit palindromic numbers divisible by 9 formed using digits 1 to 9
- Count of triplets (a, b, c) in the Array such that a divides b and b divides c
- Check whether the binary equivalent of a number ends with "001" or not
- Find the Nth natural number which is not divisible by A
- Count of pairs of integers whose difference of squares is equal to N
- Sum of product of all subsets formed by only divisors of N
- Count of integers in an Array whose length is a multiple of K
- Find the Largest divisor Subset in the Array
- Minimum steps to reach N from 1 by multiplying each step by 2, 3, 4 or 5
- Check if the number is divisible 43 or not
- Minimum number of swaps required to make a number divisible by 60
- Find N numbers such that a number and its reverse are divisible by sum of its digits
- Check if a number is divisible by 31 or not
- Check whether a large number is divisible by 53 or not
- Sum of division of the possible pairs for the given Array
- Check if a number is divisible by 47 or not
- Count the factors of K present in the given Array
- Sum of first K numbers which are not divisible by N
- Check if the given number is divisible by 71 or not
- Split the number N by maximizing the count of subparts divisible by K

Given an arr[] consisting of N elements, the task is to count all subarrays of size K having atleast one pair whose absolute difference is… Read More »

Given two integer N and K, the task is to find the number of sequence of length K consisting of values from the range [1,… Read More »

Given an integer N, the task is to make an array of unique elements of length N such that all subarrays sum modulo N equals… Read More »

Given three integer N, K and X, the task is to create an array of length N suach that sum of all its K-length subarrays… Read More »

Given two integers A and B, representing the count of objects of two different types, and another integer N which represents the number of shelves,… Read More »

Given an array arr[], the task is to determine the number of elements of the array which are not divisible by any other element in… Read More »

Given a positive integers N, the task is to find the smallest N digit number divisible by N. Examples: Input: N = 2 Output: 10… Read More »

Given an array of integers arr[] and a positive integer K, the task is to find the count of the longest possible subarrays with sum… Read More »

Given an array arr[] of length N, the task is to check if it is possible to split the given array into K non-empty and… Read More »

Given an array arr[] of N positive integers. For all the possible pairs (x, y) the task is to find the summation of x/y. Note:… Read More »

Given a positive integer N, the task is to find the count of pairs of integers (x, y) whose difference of squares is equal to… Read More »

Given a positive integer N, the task is to check whether the binary equivalent of that integer ends with “001” or not. Print “Yes” if… Read More »

Given a numeric string N and an integer K, the task is to split digits of N into subparts such that the number of segments… Read More »

Given a range in the form of L and R, and a value K, the task is to count the numbers between the range L… Read More »

Given two numbers N and K, the task is to find the sum of first K numbers which are not divisible by N. Examples: Input:… Read More »