Given a partially filled 9×9 2D array ‘grid’, the goal is to assign digits (from 1 to 9) to the empty cells so that every row, column, and subgrid of size 3×3 contains exactly one instance of the digits from 1 to 9.Įxplanation: Each row, column and 3*3 box of Print all paths from a given source to a destination.
Given an array A and a number x, check for pair in A with sum as x (aka Two Sum).Write a program to print all permutations of a given string.
Construct Full Binary Tree from given preorder and postorder traversals.Construct a Binary Tree from Postorder and Inorder.Construct Tree from given Inorder and Preorder traversals.Print Postorder traversal from given Inorder and Preorder traversals.Inorder Tree Traversal without recursion and without stack!.Inorder Tree Traversal without Recursion.Tree Traversals (Inorder, Preorder and Postorder).Breadth First Search or BFS for a Graph.Unique paths covering every non-obstacle block exactly once in a grid.Print all possible paths from top left to bottom right of a mXn matrix.Count all possible paths from top left to bottom right of a mXn matrix.Count number of ways to reach destination in a Maze.The Knight’s tour problem | Backtracking-1.Warnsdorff’s algorithm for Knight’s tour problem.Printing all solutions in N-Queen Problem.ISRO CS Syllabus for Scientist/Engineer Exam.