## Multiply a number by 15 without using * and / operators

Given a integer N, the task is to multiply the number with 15 without using multiplication * and division / operators. Examples: Input: N =… Read More »

- Minimum sum of two numbers formed from digits of an array in O(n)
- How to concatenate two Integer values into one?
- Check whether a number can be represented as sum of K distinct positive integers
- Length of the smallest number which is divisible by K and formed by using 1's only
- Minimize the cost to split a number
- Find n positive integers that satisfy the given equations
- Count the number of operations required to reduce the given number
- Natural Numbers
- Find the minimum number of steps to reach M from N
- Common prime factors of two numbers
- Divide a number into two parts
- Find permutation of first N natural numbers that satisfies the given condition
- Find largest number smaller than N with same set of digits
- Smallest multiple of 3 which consists of three given non-zero digits
- Find the minimum positive integer such that it is divisible by A and sum of its digits is equal to B
- Count of all even numbers in the range [L, R] whose sum of digits is divisible by 3
- Smallest multiple of N formed using the given set of digits
- Print all Semi-Prime Numbers less than or equal to N
- Find maximum product of digits among numbers less than or equal to N
- Generate all unique partitions of an integer | Set 2
- Number of pairs from the first N natural numbers whose sum is divisible by K
- Smallest and Largest N-digit perfect squares
- Check whether factorial of N is divisible by sum of first N natural numbers
- Find average of two numbers using bit operation
- Sum of two numbers where one number is represented as array of digits
- Find the number of good permutations
- Find the sum of numbers from 1 to n excluding those which are powers of K
- Sum of all even numbers in range L and R
- Total distinct pairs of ugly numbers from two arrays
- Minimum number operations required to convert n to m | Set-2

Given a integer N, the task is to multiply the number with 15 without using multiplication * and division / operators. Examples: Input: N =… Read More »

Given two integer N and K, the task is to find the sum of all the numbers from the range [1, N] excluding those which… Read More »

There are infinite people standing in a row, indexed from 1. A person having index i has strength of i2. You have strength P and… Read More »

Given a positive integer n, the task is to generate all possible unique ways to represent n as sum of positive integers. Examples: Input: 4… Read More »

Given two integers x and y, the task is to find the average of these numbers i.e. (x + y) / 2 using bit operations.… Read More »

Given an array arr[] of N integers. The integers represent all the divisors of a number X except 1 and X itself. The task is… Read More »

Given a permutation P of first N natural numbers, the task is to count the index pairs (i, j) such that P[i] + P[j] =… Read More »

Given two integers N and K, the task is to check whether N can be represented as sum of K distinct positive integers. Examples: Input:… Read More »

Given two integers a and b, the task is to check whether the product of integers from the rage v[a, b] i.e. a * (a… Read More »

Given an array arr[] of size N which represents the digits of a number and an integer r which is the base (radix) of the… Read More »

Given an array of digits (values are from 0 to 9), find the minimum possible sum of two numbers formed from digits of the array.… Read More »

Given an integer N, the task is to find the minimum possible integer X such that X % M = 1 for all M from… Read More »

Given a set of digits S and an integer N, the task is to find the smallest positive integer if exists which contains only the… Read More »

Given two integer N and K, the task is to find the permutation P of first N natural numbers such that there are exactly K… Read More »

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 »