Sudoku Solver using Backtracking
Let’s implement a Sudoku solver using a backtracking & recursive algorithm for the grid of variable size (N x N).
Category: Backtracking & Recursion
Permutations of a string
Each of these permutations represents a unique arrangement of the elements. Total number of permutations of a set will always be n!
Non-decreasing Subsequences Solution – LeetCode Solution [Medium]
Given an integer array nums, return all the different possible non-decreasing subsequences of the given array with at least two elements.
Tower of Hanoi | Recursion using Mathematical Induction
The Tower of Hanoi is a mathematical puzzle (game) consisting of three rods and a number of disks.
The objective of the puzzle is to move all the disks from the first rod (A) to the next rod (B) using the auxiliary rod (C).
Rat in the maze
Given a NxN matrix with 0s and 1s. A block with value 1 can be used to travel ahead in the matrix. Now, consider mat[0][0] as the starting point for the rat.
Multiset Partitioning Problem
The number of possible partition of a set of n elements is B(n) known as Bell number. As we know, this problem is NP-Complete i.e. it has non-polynomial time solution.
N Queens Problem Analysis
N Queens is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other.
Backtracking
Backtracking is a general algorithm for finding solutions to some computational problems, that incrementally builds candidates to the solutions, and abandons a candidate (“backtracks”) as soon as it determines that the candidate cannot possibly be completed to a valid solution.