## Minimum operations to make two numbers equal

Given two numbers n and m, the task is to find the minimum number of operations required to make them equal if the following operations… 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 two numbers n and m, the task is to find the minimum number of operations required to make them equal if the following operations… Read More »

Given a sum S and an integer N, The task is to remove two consecutive integers from 1 to N to make sum equal to… Read More »

Given a number N, the task is to find two composite numbers X and Y, such that difference between them is equal to N. Note… Read More »

Given an integer N, the task is to check whether the sum of digits of N is palindrome or not. Example: Input: N = 56… Read More »

Given a large integer N, the task is to find all the possible remainders when N is divided by all the positive integers from 1… Read More »

Given a number n, the task is to determine whether n can be a factorial of some number x Examples: Input: N = 24 Output:… Read More »

Given the pointers to the head nodes of two linked lists. The task is to compare the numbers represented by the linked lists. The numbers… Read More »

Given a string S consisting of a large hexadecimal number, the task is to check its divisibility by a given decimal number M. If divisible… Read More »

Given a number N, the task is to clear the K-th bit of this number N. If K-th bit is 0, then set it to… Read More »

Given a number N, the task is to clear the K-th bit of this number N. If K-th bit is 1, then clear it to… Read More »

Given an integer N and an infinite table where ith row and jth column contains the value i *j. The task is to find the… Read More »

Given a floating point number N, the task is to check whether it is palindrome or not. Input: N = 123.321 Output: Yes Input: N… Read More »

Given four integers a, b, c and d. The task is to check whether it is possible to pair them up such that they are… Read More »

Given a Fibonacci number N, the task is to find the previous Fibonacci number. Examples: Input: N = 8 Output: 5 5 is the previous… Read More »

Given an integer N, the task is to represent N as the sum of two composite integers. There can be multiple ways possible, print any… Read More »