solved Backtracking-1 problems

[param07]

No description provided.

[super30admin]

Strengths:

• The student demonstrates a strong understanding of backtracking and recursion.
• The code is well-commented, making it easy to follow the logic.
• The student provides multiple approaches (with and without backtracking) for Problem1, showing versatility.

Areas for Improvement:

• In Problem1, the student uses copy.deepcopy in some places where a simple list copy might suffice, which could slightly improve performance.
• For Problem2, the student could consider memoization to optimize repeated calculations, though this might complicate the solution.
• The student could further optimize the handling of the tail variable in Problem2 to make the code slightly more efficient.