## Minimum number of operations required to delete all elements of the array

Given an integer array arr, the task is to print the minimum number of operations required to delete all elements of the array. In an… Read More »

- Ugly Numbers
- Count all sub-arrays having sum divisible by k
- Subset with sum divisible by m
- Largest divisible pairs subset
- Find the number closest to n and divisible by m
- Number of subsequences in a string divisible by n
- Total number of divisors for a given number
- Count sub-matrices having sum divisible 'k'
- Check if any valid sequence is divisible by M
- Check if any permutation of a large number is divisible by 8
- Count pairs in array whose sum is divisible by 4
- Print array elements that are divisible by at-least one other
- Find the largest multiple of 3 | Set 1 (Using Queue)
- Maximum path sum for each position with jumps under divisibility condition
- Generating numbers that are divisor of their right-rotations
- Check if a large number is divisible by 4 or not
- Count divisible pairs in an array
- Count the numbers divisible by 'M' in a given range
- Check divisibility in a binary stream
- Check a number is odd or even without modulus operator
- Subset with no pair sum divisible by K
- Check if a large number is divisible by 3 or not
- Check if a large number is divisible by 11 or not
- Number of substrings divisible by 6 in a string of integers
- Number of substrings divisible by 8 but not by 3
- Check if a large number is divisible by 2, 3 and 5 or not
- DFA based division
- Program to find remainder when large number is divided by r
- Number of divisors of a given number N which are divisible by K
- Number of Groups of Sizes Two Or Three Divisible By 3

Given an integer array arr, the task is to print the minimum number of operations required to delete all elements of the array. In an… Read More »

Given a number N, the task is to check whether the product of digits at even places of a number is divisible by K. If… Read More »

Given an integer element ‘N’, the task is to find the minimum number of operations that need to be performed to make ‘N’ equal to… Read More »

Given two integer ‘N’ and ‘K’, the task is to find the sum of digits of ‘N’ at it’s odd places (right to left) and… Read More »

Suppose you a given an array. You have to find the length of the longest subarray such that each and every element of it is… Read More »

Given an interval of integers [A, B]. For each number in this interval compute its greatest odd divisor. Output the sum of these divisors. Examples:… Read More »

Given an unsigned integer x. Round it up to the next greater multiple of 8 using bitwise operations only. Examples: Input : 35 Output :… Read More »

Given an unsigned integer x. Round it down to the next smaller multiple of 8 using bitwise operations only. Examples: Input : 35 Output :… Read More »

Given two integers A and B. The task is to count how many numbers in the interval [ A, B ] have an odd number… Read More »

Given a range, we need to check if is their any pairs in the segment whose GCD is divisible by k. Examples: Input : l=4,… Read More »

Given two integers and . The task is to find the Nth term which is divisible by either of or . Examples : Input :… Read More »

Given an array of integers ‘arr’ and a number x, the task is to sort all the elements which are multiples of x of the… Read More »

Given a number N. The task is to find the sum of all those numbers from 1 to N that are divisible by 2 or… Read More »

Given a number n, find the highest power of 2 that divides n. Examples: Input : n = 48 Output : 16 Highest power of… Read More »

Given an array of integers. The task is to find the maximum count of equal numbers in an array after applying the given operation any… Read More »