## Find Longest Possible Route in a Matrix

Given a rectangular path in the form of binary matrix, find the length of longest possible route from source to destination position of the matrix by moving to only non-zero adjacent positions i.e. route can be formed from positions having their value as 1. Note there should not be any cycles in the output path.

## Find Shortest Path in Maze

Given a maze in the form of the binary rectangular matrix, find length of the shortest path in maze from given source to given destination. The path can only be constructed out of cells having value 1 and at any given moment, we can only move one step in one of the four directions.

## Magnet Puzzle

We are given set of bipolar magnets each domino-shaped. The objective is to place magnets on a M X N board which should meet a set of conditions where both N and M are not odd.

## Print all possible solutions to N Queens problem

The N queens puzzle is the problem of placing N chess queens on an N × N chessboard so that no two queens threaten each other. Thus, a solution requires that no two queens share the same row, column, or diagonal.

## Print all numbers between 1 to N without using semicolon

Write a program to print all numbers between 1 to N without using semicolon.

## Swap two numbers without using third variable | 5 methods

Given two integers, swap them without using any third variable.

## Determine the if condition to print specific output

What should be the if condition in below code snippet, so that output would be “Hello World”. if “condition” printf (“Hello”); else printf(“World”);

## Find maximum, minimum of three numbers without using conditional statement and ternary operator | 4 methods

Given three integers, find maximum and minimum number between them without using conditional statement or ternary operator.

## Find numbers represented as sum of two cubes for two different pairs

Given a large number N, find all positive numbers less than N that can be represented as sum of two cubes for at-least two different pairs. In other words, find all positive numbers M less than given number N that can be expressed as M = (a^3 + b^3) = (c^3 + d^3) for …

## Print “Hello World” with empty main function | 3 methods

Write a program to print “Hello World” without writing anything inside main() function i.e. main() function should be empty.