Q1.What is the core idea of backtracking?
Q2.What is "pruning" in the context of backtracking?
Q3.What is the typical time complexity characteristic of backtracking algorithms without effective pruning?
Q4.In the classic N-Queens problem, what does backtracking do when placing a queen creates a conflict?
