## Smallest number k such that the product of digits of k is equal to n

Given a non-negative number n. The problem is to find the smallest number k such that the product of digits of k is equal to… 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 non-negative number n. The problem is to find the smallest number k such that the product of digits of k is equal to… Read More »

Given a number you have to check whether there is pair of adjacent set bit or not. Examples : Input : N = 67 Output… Read More »

Before inviting for F2f rounds I was given a online coding test, which had standard PS/DS problems. After that I was invited for a day… Read More »

Given two integers a and b. The problem is to find the number of digits in the product of these two integers. Examples: Input :… Read More »

Lucky numbers are the positive integers whose decimal representations contain only the lucky digits 4 and 7. What minimum lucky number has the sum of… Read More »

Given two integers n and m. Find the longest contiguous subset in binary representation of both the numbers and its decimal value. Example 1: Input… Read More »

Round 1(2 hrs): It had two sections: 1. 50 Mcqs in 60 minutes. The questions included were related to networking, OS, quantitative aptitude, c, c++,… Read More »

Given a non-negative number n and a value k. Find the kth smallest number that can be formed using the digits of the given number… Read More »

Microsoft IDC came to our campus to recruit summer interns. The selection procedure involved a coding round, group fly followed by 3 interviews. Round 1… Read More »

Given two numbers N and K. We need to find out if ‘N’ can be written as sum of ‘K’ prime numbers. Given N <=… Read More »

Question 1 : Write a program to determine whether a given number can be expressed as sum of two prime numbers or not. For example… Read More »

Given a number n, count all distinct divisors of it. Examples: Input : 18 Output : 6 Divisors of 18 are 1, 2, 3, 6,… Read More »

Given a string that contains digits of a number. The number may contain many same continuous digits in it. The task is to count number… Read More »

Which of the following is the largest of all ? (i) 7/8 (ii) 15/16 (iii) 23/24 (iv) 31/32 (A) (i) (B) (ii) (C) (iii) (D)… Read More »

Two numbers are in the ratio of 5:7. If their LCM is 105, what is the difference between their squares ? (A) 216 (B) 210… Read More »