## Minimum queens required to cover all the squares of a chess board

Given the dimension of a chess board (N x M), determine the minimum number of queens required to cover all the squares of the board.… Read More »

Given the dimension of a chess board (N x M), determine the minimum number of queens required to cover all the squares of the board.… Read More »

Given n eggs and k floors, find the minimum number of trials needed in worst case to find the floor below which all floors are… Read More »

The task is to Increment a number without using ++ and + operators. Examples: Input : 3 Output : 4 Input : 9 Output :… Read More »

There are N Children are seated on N chairs arranged around a circle. The chairs are numbered from 1 to N. The game starts going… Read More »

When doing addition/subtraction on binary numbers in other representations we need to apply different logics (circuits) to perform addition and subtraction. In 2s-complement representation, we… Read More »

Given 2 eggs and k floors, find the minimum number of trials needed in worst case. This problem is a specific case of n eggs… Read More »

Write a program to subtract one from a given number. The use of operators like ‘+’, ‘-‘, ‘*’, ‘/’, ‘++’, ‘–‘ …etc are not allowed.… Read More »

Given an array of n integers, both negative and positive, partition them into two different arrays without comparing any element with 0. Examples: Input :… Read More »

Given programs stored on a computer tape and length of each program is where , find the order in which the programs should be stored… Read More »

A 10 x 10 Crossword grid is provided, along with a set of words (or names of places) which need to be filled into the… Read More »

Print the Fibonacci sequence. The first Fibonacci numbers are: C++ // Simple CPP Program to print Fibonacci // sequence #include <iostream> using std::cout; void fib(int… Read More »

Suppose we have four variables a, b, c, d and we want to perform swapping of these variables in the following manner a = b,… Read More »

Design a data structure which can do following operations add() in O(n) getMinimum() in O(1) deleteMinimum() in O(1) Source : MakeMyTrip Interview. Recommended: Please try… Read More »

Given starting and ending position and a number N. Given that we are allowed to move in only four directions as shown in the image… Read More »

Place the numbers 1, 2, 3, 4, 5, 6, 7, 8 into the eight circles in the figure given below, in such a way that… Read More »