## Maximize the given number by replacing a segment of digits with the alternate digits given

Given a large number of N digits. We are also given with 10 numbers which represents the alternate number for all the one-digit numbers from… Read More »

- Program to find absolute value of a given number
- Count rotations which are divisible by 10
- Count of N digit Numbers whose sum of every K consecutive digits is equal
- Find the Kth number which is not divisible by N
- Find the Nth Pure number
- Find any K distinct odd integers such that their sum is equal to N
- Program to balance the given Chemical Equation
- Minimum operations required to make two numbers equal
- Represent N as sum of K even or K odd numbers with repetitions allowed
- Check if a given pair of Numbers are Betrothed numbers or not
- Largest value of x such that ax
^{x}is N-digit number of base b - Count of unique digits in a given number N
- Curzon Numbers
- Represent N as sum of K even numbers
- Print all numbers in given range having digits in strictly increasing order
- Min operations to reduce N to 1 by multiplying by A or dividing by B
- Find N distinct integers with zero sum
- Convert string to integer without using any in-built functions
- Represent N as sum of K odd numbers with repetitions allowed
- How to store a very large number of more than 100 digits in C++
- Minimize steps to reach K from 0 by adding 1 or doubling at each step
- Minimum number of operations required to reduce N to 0
- Find two numbers with difference and division both same as N
- Minimize the cost of selecting two numbers whose product is X
- Find two Fibonacci numbers whose sum can be represented as N
- Check if a number ends with another number or not
- Length of Longest Perfect number Subsequence in an Array
- Count of numbers in Array ending with digits of number N
- Sum of product of all integers upto N with their count of divisors
- Count of Fibonacci pairs with sum N in range 0 to N

Given a large number of N digits. We are also given with 10 numbers which represents the alternate number for all the one-digit numbers from… Read More »

Given an integer N > 0, the task is to find the maximum product of digits among numbers less than or equal to N. Examples:… Read More »

Given an integer N ≥ 1, the task is to find the smallest N digit number which is a multiple of 5. Examples: Input: N… Read More »

Given an integer N, the task is to check whether the product of first N natural numbers is divisible by the sum of first N… Read More »

Given an integer N containing the digit 4 at least once. The task is to divide the number into two parts x1 and x2 such… Read More »

Given three integers N, X and Y. The task is to find N positive integers that satisfy the given equations. a12 + a22 + ….… Read More »

Given an array arr[] of integer elements, the task is to arrange them in such a way that these numbers form the smallest possible number.… Read More »

Given that a certain amount of money becomes T1 times itself in N1 years. The task is to find the number of years i.e. N2… Read More »

Given an integer K, the task is to find the length of the smallest no. N which is divisible by K and formed by using… Read More »

Given a number ‘N’. Check whether factorial of ‘N’ is divisible by the sum of first ‘N’ natural numbers or not? If divisibility is possible,… Read More »

Given an array arr[] of digits and an integer K, the task is to find num(arr) + K where num(arr) is the number formed by… Read More »

Given an integer k and an array op[], in a single operation op[0] will be added to k and then in the second operation k… Read More »

Given two integers N and M. The task is to find the minimum number of steps to reach M from N by performing given operations.… Read More »

Given an integers X. The task is to find the number of jumps to reach a point X in the number line starting from zero.… Read More »

Given a number N. The task is to find the number of integers from 1 to n which contains digits 0’s and 1’s only. Examples:… Read More »