## Place K-knights such that they do not attack each other

Given integers M, N and K, the task is to place K knights on an M*N chessboard such that they don’t attack each other. The… Read More »

- Backtracking | Introduction
- Samsung Semiconductor Institute of Research(SSIR Software) Intern/FTE | Set-2
- Recursive program to generate power set
- Rat in a Maze | Backtracking using Stack
- Count all possible position that can be reached by Modified Knight
- Minimum cost to reach a point N from 0 with two different operations allowed
- Place K-knights such that they do not attack each other
- Print all the combinations of a string in lexicographical order
- OYO Rooms Interview Experience (On-Campus)
- Smallest number with given sum of digits and sum of square of digits
- Minimum queens required to cover all the squares of a chess board
- Print the DFS traversal step-wise (Backtracking also)
- Minimum swaps to group similar characters side by side?
- Bank Of America (BA Continuum India Pvt. Ltd.) Campus Recruitment
- Java Program for Phone Mnemonics
- Horizontally Flip a Binary Matrix

Given integers M, N and K, the task is to place K knights on an M*N chessboard such that they don’t attack each other. The… Read More »

Given a string, find minimum no of swaps(not necessarily adjacent) to convert it into a string which have similar characters side by side. Examples: Input… Read More »

Given a binary matrix. The task is to flip the matrix horizontally(find the image of the matrix), then invert it. Note: To flip a matrix… Read More »

Given integers N, P and Q where N denotes the destination position. The task is to move from position 0 to position N with minimum… Read More »

Given a chessboard of size 8 x 8 and the current position of Mirandote. All the rules of this chess game are same but the… Read More »

In our daily lives, we have to remember a lot of phone numbers. Most people find it quite difficult to remember such huge 10-digit phone… Read More »

Prerequisites – Recursion, Backtracking and Stack Data Structure. A Maze is given as N*M binary matrix of blocks and there is a rat initially at… Read More »

There are N Balloons marked with value Bi (where B(i…N)). User will be given Gun with N Bullets and user must shot N times. When… 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 »

Approved Offer. Bank Of America has visited our college for on campus recruitment . The recruitment consisted of 4 Rounds in total. The recruitment was… Read More »

Given a string str, print of all the combinations of a string in lexicographical order. Examples: Input: str = “ABC” Output: A AB ABC AC… Read More »

Given a graph, the task is to print the DFS traversal of a graph which includes the every step including the backtracking. 1st step:- 0… Read More »

Round 1: Round 1 was for 200 marks. 25 MCQs and 2 coding questions .The MCQs were mostly on aptitude and some were Technical (C++… Read More »

Prerequisites : Recursion Complexity Analysis Backtracking is an algorithmic-technique for solving problems recursively by trying to build a solution incrementally, one piece at a time,… Read More »

Given a set represented as string, write a recursive code to print all subsets of it. The subsets can be printed in any order. Examples:… Read More »