Top 20 Backtracking Algorithm Interview Questions

3.6
  1. N Queens Problem
  2. Warnsdorff’s Algorithm
  3. Word Break Problem
  4. Remove Invalid Parenthesis
  5. Match a pattern and string using regular expression
  6. Find Path from corner cell to middle cell in a maze
  7. Hamiltonian cycle
  8. Sudoku
  9. M Coloring Problem
  10. Rat in a Maze
  11. Print all permutations of a given string
  12. Crptarithmetic puzzle
  13. Find if there is a path of more than k length from a source
  14. Shortest safe route in a path with landmines
  15. Partition of a set into k subsets with equal sum
  16. longest possible route in a matrix with hurdles
  17. Print palindromic partitions string
  18. Print all possible paths from top left to bottom right of a mXn matrix
  19. Subset sum
  20. Tug of war

Recent Articles on Backtracking
Coding Practice on Backtracking

 

This article is contributed by Ayushmaan Bansal. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

GATE CS Corner    Company Wise Coding Practice

Recommended Posts:



3.6 Average Difficulty : 3.6/5.0
Based on 6 vote(s)










Writing code in comment? Please use ide.geeksforgeeks.org, generate link and share the link here.