# Tag Archives: Number Divisibility

Given an integer X, the task is to find the possible values of Q for the pair (Q, R) such that their product is equal… Read More
Given an integer N, the task is to count the minimum steps required to reduce the value of N to 0 by performing the following… Read More
Given an integer N, the task is to check if the concatenation of first N natural numbers is divisible by 3 or not. Print Yes… 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 Explanation: 10 is… 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 = 10203 Output:… 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 Explanation: 9009 is the… Read More