## Smallest N digit number divisible by N

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 »

- Count rotations which are divisible by 10
- Count numbers divisible by K in a range with Fibonacci digit sum for Q queries
- Find a N-digit number such that it is not divisible by any of its digits
- Sum of all numbers in the given range which are divisible by M
- Sum of all N digit palindromic numbers divisible by 9 formed using digits 1 to 9
- Largest palindrome which is product of two N-digit numbers : Set 2
- Check if the number is divisible 43 or not
- Count of N digit palindromic numbers divisible by 9
- Minimum number of swaps required to make a number divisible by 60
- Check whether a given number N is a Nude Number or not
- Check if a number is divisible by 31 or not
- Check if a number is divisible by 47 or not
- Maximize array sum by X increments when each element is divided by 10
- Maximize the division result of Array using given operations
- Count of longest possible subarrays with sum not divisible by K
- Check if the given number is divisible by 71 or not
- Partitions possible such that the minimum element divides all the other elements of the partition
- Implementation of Non-Restoring Division Algorithm for Unsigned Integer
- Smallest N digit number divisible by N

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 integer N, the task is to check whether N is a Nude number or not. A Nude number is a number that is… Read More »

Given an array arr[] consisting of N non-negative elements and an integer X, the task is to make X increments such that the value of… Read More »

Given an array arr[] of N integers, the task is to find the maximum value possible remaining in the array by repeating the following two… Read More »

In the previous article, we have already discussed the Non-Restoring Division Algorithm. In this article, we will discuss the implementation of this algorithm. Non-restoring division… Read More »

Given an integer N, the task is to count the number of N digit palindromic numbers containing digits from 1 to 9 and divisible by… Read More »

Given a number N, the task is to find the sum of all N digits palindromic numbers (formed by digits from 1 to 9) that… Read More »

Given a number N, the task is to count all the rotations of the given number which are divisible by 10. Examples: Input: N =… Read More »

Given an array arr[][] containing Q queries and an integer K where each query consists of a range [L, R], the task is to find… Read More »

Given an integer N , the task is to find the minimum number of swaps required to make N divisible by 60. If not possible,… Read More »

Given a value N, find out the largest palindrome number which is the product of two N-digit numbers. Examples: Input: N = 2 Output: 9009… Read More »

Given a number N, the task is to check whether the number is divisible by 47 or not. Examples: Input: N = 1645 Output: yes… Read More »

Given a number N, the task is to check whether the number is divisible by 31 or not. Examples: Input: N = 1922 Output: Yes… Read More »

Given a number N, the task is to check whether the number is divisible by 43 or not. Examples: Input: N = 2795 Output: yes… Read More »