Skip to content

Tag Archives: number-digits

Given three positive integers N, K, and M. The task is to find Kth largest N digit number divisible by M.  Note: K will be… Read More
Given an array containing digits[], where each element is a single digit integer. The array may contain duplicates. The task is to find all the… Read More
Given a number N, the task is to find the minimum number of digits that needs to be removed from the number so that the… Read More
Given a number N, the task is to check whether the digits of the number are increasing and decreasing alternatively. If the number of digits… Read More
Given a 32-bit integer N. The task is to reverse N, if the reversed integer overflows, print -1 as the output. Examples Input: N =… Read More
Given integers L and R, find all numbers in range L to R whose digits are increasing-decreasing alternatively i.e. if the digits in the current… Read More
Given a number N, the task is to print the digits of N which divide N. Example: Input: N = 234Output: 2 3 Input: N… Read More
Given an array arr[]. The task is to count the elements in the array that are divisible by either their product of digits or the… Read More
Given two integers L and R, the task is to count the integers in the range [L, R] such that they satisfy the following two… Read More
Given a number N, the task is to find the minimum number of operations to convert the given integer into any power of K where… Read More
Given an array arr, the task is to find the sum of the product of digits of all array elements Example: Input: arr[]={11, 23, 41}Output:… Read More
Given a positive integer number N. The task is to generate all the binary numbers of N digits. These binary numbers should be in ascending… Read More
Given a number ‘n’ and our goal is to find out it is palindrome or not without using any extra space. We can’t make a new… Read More
Given an array arr[]. The task is to create the smallest K digit number divisible by all numbers of arr[]. Examples: Input: arr[] = {2,… Read More
Given two integers N and K. The task is to count all positive integers with length N having an absolute difference between adjacent digits equal… Read More

Start Your Coding Journey Now!