Scanftree.com
  • Academic Tutorials
      • Automata
      • Data Structure
      • OS
      • Graph Theory
      • Microprocessor
      • Cryptography
      • Compiler Design
      • Computer Graphics
      • IPv4
      • Parallel Algorithm
  • Programming
      • Tutorials
      • ASP.NET MVC
      • C
      • C++
      • JAVA
      • C#
      • Python
      • Programs
      • C
      • C++
      • JAVA
      • Python
  • Database Concept
    • DBMS
    • SQL
    • SQLite
    • TSQL-MSSQL
  • Preparation
      • Syllabus
      • Gate

      • Interview
      • Technical
      • HR/PI
      • Gk/Aptitude
      • Gk
      • Aptitude
      • MCQ
      • C
      • JAVA
      • Networking
  • Miscellaneous
      • Calculator
      • Health
      • Math
      • Developers
      • Css/Html Maker
      • Cheat Sheets
      • SEO Tools
      • Other
      • Math Formulas
      • IFSC Codes
  •

: Scanftree

tutorial

algorithms

backtracking

Algorithms
Menu SEE THE INDEX
  • Introduction
  • Pages
    • Analysis of Algorithms
      • Pseudo-polynomial Algorithms
      • Worst, Average and Best Cases
      • Asymptotic Notations
      • Analysis of Loops
      • Solving Recurrences
      • Amortized Analysis Introduction
      • Space Complexity
      • NP-Completeness
      • Polynomial Time Approximation Scheme
      • A Time Complexity
    • Divide and Conquer
      • calculate pow(x,n)
    • Backtracking
      • The Knight’s tour problem
      • Rat in a Maze
      • N Queen Problem
      • Subset Sum
      • m Coloring Problem
      • Hamiltonian Cycle
      • Sudoku
      • Tug of War
      • Solving Cryptarithmetic Puzzles
    • Skip to content

    Backtracking

    1. Print all permutations of a given string
    2. The Knight’s tour problem
    3. Rat in a Maze
    4. N Queen Problem
    5. Subset Sum
    6. m Coloring Problem
    7. Hamiltonian Cycle
    8. Sudoku
    9. Tug of War
    10. Solving Cryptarithmetic Puzzles

    Aptitude / Reasoning / Interview
    Physical education & sports