Hey Guys,

I am trying to solve Backtracking problems.currently dealing with Permutation of String/Numbers problem(it might be easy problem for you all) . i am having hard time understanding backtracking ..I had to write it down on paper to understand all the backtracking calls .

what's the best way to understand Backtracking? are there any good tutorials out there?
if I search backtracking on youtube ,people directly starts explaning about N-Queens problem,Knights-problem etc.