## Smallest number greater than or equal to N divisible by K

Given a number N and a number K, the task is to find the smallest number greater than or equal to N which is divisible… Read More »

- Coin Change | DP-7
- Write a program to print all permutations of a given string
- Sieve of Eratosthenes
- Program for Fibonacci numbers
- Ugly Numbers
- Set in C++ Standard Template Library (STL)
- Count Possible Decodings of a given Digit Sequence
- Minimum number of jumps to reach end
- Segment Tree | Set 1 (Sum of given range)
- Program to find GCD or HCF of two numbers
- Min Cost Path | DP-6
- Efficient program to print all prime factors of a given number
- Count all possible paths from top left to bottom right of a mXn matrix
- Find minimum number of coins that make a given value
- Program for nth Catalan Number
- Binomial Coefficient | DP-9
- The Knight's tour problem | Backtracking-1
- Optimal Strategy for a Game | DP-31
- Median in a stream of integers (running integers)
- C++ Data Types
- Find next greater number with same set of digits
- Counting Sort
- Euclidean algorithms (Basic and Extended)
- Check whether a number is semiprime or not
- Median of two sorted arrays of same size
- Modular Exponentiation (Power in Modular Arithmetic)
- GCD of more than two (or array) numbers
- Count ways to reach the n'th stair
- Given a number, find the next smallest palindrome
- Prime Numbers

Given a number N and a number K, the task is to find the smallest number greater than or equal to N which is divisible… Read More »

Given four integers x, y, z and n, the task is to find the largest n digit number which is divisible by x, y and… Read More »

Prerequisite: Graph Theory Basics – Set 1, Graph Theory Basics – Set 2 A graph G = (V, E) consists of a set of vertices… Read More »

Given an integer N, below operations can be performed any number of times on N: Multiply N by any positive integer X i.e. N =… Read More »

Given two strings, the task is to check whether the frequencies of a character(for each character) in one string is a multiple or a factor… Read More »

Given a number N, the task is to find the smallest number not less than N, which has all digits odd. Examples: Input: N =… Read More »

Given a positive integer N. The task is to find sum and product of digits of the number which evenly divides the number n. Examples:… Read More »

Given a number N and a number K, the task is to find the largest number smaller than or equal to N which is divisible… Read More »

Given an integer . The task is to check whether any of its permutations is a palindrome and divisible by 3 or not. Examples :… Read More »

Given M x N Chessboard. The task is to determine the Maximum numbers of cuts that we can make in the Chessboard such that the… Read More »

Given a perimeter P and area A, the task is to calculate the maximum volume that can be made in form of cuboid from the… Read More »

Given an integer K and two arrays A1 and A2, the task is to return the total number of pairs (one element from A1 and… Read More »

Given an integer N. The task is to find the lexicographically smallest permutation of integer of the form: 12345…N such that no digit occurs at… Read More »

Given a function F(n) = P – (0.006 * n), where P is given. Given a list of integers and a number, . The task… Read More »

Given an Integer N. The task is count numbers P less than N such that P is a product of two distinct perfect squares. Examples:… Read More »