## Count rotations which are divisible by 10

Given a number N, the task is to count all the rotations of the given number which are divisible by 10. Examples: Input: N =… Read More »

- Program to find absolute value of a given number
- Count of N digit Numbers whose sum of every K consecutive digits is equal
- Count rotations which are divisible by 10
- 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
- Minimum number of operations required to reduce N to 0
- Min operations to reduce N to 1 by multiplying by A or dividing by B
- Print all numbers in given range having digits in strictly increasing order
- Find N distinct integers with zero sum
- How to store a very large number of more than 100 digits in C++
- Convert string to integer without using any in-built functions
- Represent N as sum of K odd numbers with repetitions allowed
- Minimize steps to reach K from 0 by adding 1 or doubling at each step
- 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
- Find Maximum and Minimum of two numbers using Absolute function

Given a number N, the task is to count all the rotations of the given number which are divisible by 10. Examples: Input: N =… Read More »

Given two positive numbers N and M, the task is to check whether the given pairs of numbers (N, M) form a Betrothed Numbers or… Read More »

Given a number N, the task is to find the count of Fibonacci pairs in range 0 to N whose sum is N. Examples: Input:… Read More »

Prerequisite: To Find Maximum and Minimum Prime Number Given four integers A, B, C and X, the task is to minimize the cost of selecting… Read More »

Given an integer N, the task is to find the Nth pure number. A pure number has to satisfy three conditions: 1) It has even… Read More »

Given two integers A and B. the task is to find the minimum number of operations required to make A and B equal. In each… Read More »

Given an even number N, the task is to find two Fibonacci numbers whose sum can be represented as N. There may be several combinations… Read More »

Given a complex number z, the task is to determine the modulus of this complex number. Note: Given a complex number z = a +… Read More »

Given a sum S and product P, the task is to print any pair of integers which has the sum S and the product P.… Read More »

Dixon’s Factorization method is an integer factorization algorithm. In this article, this method is explained to find the factors of a composite number. Dixon Factorization… Read More »

Given two integers N and K, the task is to find any K distinct odd integers such that their sum is equal to N. If… Read More »

Given an integer N, the task is to find the smallest and largest N-digit numbers in Octal Number System. Examples: Input: N = 4 Output:… Read More »

Given an array arr[] of N non-negative integers, the task is to sort these integers according to their reverse Examples: Input: arr[] = {12, 10,… Read More »

Given two numbers, the task is to print the maximum and minimum of the given numbers using Absolute function. Examples: Input: 99, 18 Output: Maximum… Read More »

Given an integer N, the task is to check if the count of divisors of N is prime or not. Examples: Input: N = 13… Read More »