## Find path from source to destination in a matrix that satisfies given constraints

Given a N x N matrix of positive integers, find a path from the first cell of the matrix to its last cell.

Coding made easy

Given a N x N matrix of positive integers, find a path from the first cell of the matrix to its last cell.

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.

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.

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.

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.

Write a program to calculate n’th Fibonacci number where n is a given positive number. Fibonacci sequence is characterized by the fact that every number after the first two is the sum of the two preceding ones. For example, consider below sequence – 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, …

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

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

Given two integers, multiply them without using multiplication operator or conditional loops.

Given two positive integers, implement power function without using multiplication and division operators.