Create an output list to store the valid sequences, create a current list that will store the current sequence found in the path of the recursion tree. A backtrack function that will go into the recursion until the target is achieved, otherwise, it should backtrack to the previous phase as target becomes less than 0. At any point in time, if target becomes 0 then add the candidate array to the result as the values in the candidate array must be sum up to the given target.If those are not the cases then, one by one add the elements in ... Read More

Create an output list to store the valid sequences, create a current list that will store the current sequence found in the path of the recursion tree. A backtrack function that will go into the recursion until the target is achieved, otherwise, it should backtrack to the previous phase as target becomes less than 0. At any point in time, if target becomes 0 then add the candidate array to the result as the values in the candidate array must be sum up to the given target.If those are not the cases then, one by one add the elements in ... Read More

Distinct subsets problem gives us the different combination from the given array.When the target is 2 then from the array, we take all the combination that corresponds to number 2, When the target is three then from the array, we take all the combination that corresponds to count 3. In the below example the array is [1, 2, 3] and the target is 2. So, we take all the combinations the corresponds to number 2 “1, 2 “, “2, 3”, ”1, 3””.Example Live Demousing System; using System.Collections.Generic; using System.Text; using System.Linq; namespace ConsoleApplication{    public class BackTracking{       public ... Read More

Target sum problem is the problem of finding a subset such that the sum of elements equal a given number. The backtracking approach generates all permutations in the worst case but in general, performs better than the recursive approach towards subset sum problem.A subset A of n positive integers and a value sum is given, find whether or not there exists any subset of the given set, the sum of whose elements is equal to the given value of sumSuppose we have an array [1, 2, 3] the output will be “1, 1, 1, 1 “, “1, 1, 2”, ”2, ... Read More

The problem can be broken down into smaller and simple "subproblems", which can be further divided into yet simpler and smaller subproblems. We take each and every digit one by one and count all ndigits reachable from any digit, use a map to store the mapping of digits reachable from every digit. When the digit becomes n-digit, update the count.Example Live Demousing System; using System.Collections.Generic; namespace ConsoleApplication{    public class BackTracking{       private string GetKeyPadValueBasedOnInput(string digit){          Dictionary keypad = new Dictionary();          keypad.Add("2", "abc");          keypad.Add("3", "def");     ... Read More

Find the character in the first position and swap the rest of the character with the first character. Like in ABC, in the first iteration three strings are formed: ABC, BAC, and CBA by swapping A with A, B and C respectively. Repeat step for the rest of the characters like fixing second character B and so on. Now swap again to go back to the previous position. from ABC, we formed ABC by fixing B again, and we backtrack to the previous position and swap B with C. So, now we got ABC and ACB.Example Live Demousing System; namespace ConsoleApplication{ ... Read More

Create a function to Find Power which takes the number x and n, where x is the 2 and n is how many times, we have to do the power. If the number is even then we have to do x*x and if the number is odd multiply the result with x*x. Continue the recursive call until the n becomes 0.Suppose if we have a number 2 and 8, then 2*2*2*2*2*2*2*2 =256.Example Live Demousing System; namespace ConsoleApplication{    public class BackTracking{       public int FindPower(int x, int n){          int result;          if ... Read More

Linear scan the 2d grid map, if a node contains a '1', then it is a root node that triggers a Depth First Search. During DFS, every visited node should be set as '0' to mark as visited node. Count the number of root nodes that trigger DFS, this number would be the number of islands since each DFS starting at some root identifies an island.Example Live Demousing System; namespace ConsoleApplication{    public class Matrix{       public int PrintNumberOfIslands(char[, ] grid){          bool[, ] visited = new bool[grid.GetLength(0), grid.GetLength(1)];          int res = ... Read More

To rotate a matrix in spiral order, we need to do following until all the inner matrix and the outer matrix are covered −Step1 − Move elements of top rowStep2 − Move elements of last columnStep3 − Move elements of bottom rowStep4 − Move elements of first columnStep5 − Repeat above steps for inner ring while there is an inner matrixExample Live Demousing System; namespace ConsoleApplication{    public class Matrix{       public void PrintMatrixInSpiralOrder(int m, int n, int[, ] a){          int i, k = 0, l = 0;          while (k < ... Read More

The entire matrix needs to be rotated k number of times. In a matrix there is a total of n/2 squares in n*n matrix and we can process each square one at a time using nested loop. In each square, elements are moving in a cycle of 4 elements then we swap the elements involved in an anticlockwise direction for each cycle.Element at position (n-1-j, i) will go to position(i, j)Element at position (i, j) will go to position(j, n-1-i)Element at position (j, n-1-i) will go to position(n-1-i, n-1-j)Element at position (n-1-i, n-1-j) will go to position(n-1-j, i)Example Live Demousing System; ... Read More