# Tag Archives: number-digits

Given a number N without leading 0s, the task is to find the maximum number formed after replacing any two adjacent digits by their sum… Read More
Given two integers N and D, the task is to find the closest number to N with the sum of digits equal to D. Examples:… Read More
Given a number N, the task is to maximize this number by following the given conditions: The odd digit of the number can only be… Read More
Given a large integer N, the task is to find the largest possible integer which is divisible by 9 after inserting exactly one digit from… Read More
Given two integers L and R, and an array arr[] containing single digit integers, the task is to find all the integers in the range… Read More
Given an array arr[] of length N and integer X, the task is to count no of subarrays having digit sum equal to X. Examples:… Read More
Given a string S representing an N digit integer, the task is to find the maximum number of digits that can be removed such that… Read More
Given three positive integers X, Y, and Z. The task is to find two numbers A and B of X and Y digits respectively with… Read More
Given two number N and M, the task is to find the count of digits in N and M that are the same and are… Read More
Given two numeric string N and M, the task is to encode the given strings in the form “xAyB“, where: x is the count of… Read More
Given two numbers N and M, the task is to find the count of digits in N and M that are the same but present… Read More
Given string s denoting a number. The task is to find the minimum number that can be formed after replacing two consecutive digits of s… Read More
Given an integer N, the task is to find all N digit integers with sequential digits Examples: Input: N = 4Output: {1234, 2345, 3456, 4567,… Read More
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