Hamiltonian path is a path in an undirected or directed graph that visits each vertex exactly once. A Hamiltonian…

Find the non-empty subset whose sum is zero from given set of the integers. For example, given the set…

A Maze is given matrix and Rat start from upper left and should reach to lower right. The Rat…

The eight queen’s puzzle is the problem of placing eight chess queens on an 8 x 8 chessboard so…

Write a program to print all the possible combination of given string. source Code package com.dsacode.Algorithm.recursive; public class AllPossiblecombinations…

Graph and tree nodes can be traversed using the backtracking technique. Depth-first search (DFS) is an algorithm for traversing…

Given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors are required to color the regions of the map so that no two adjacent regions have the same color.