Add solutions for palindrome partitioning and subsets

[ravithakur2k]

Added PalindromePartioning.py implementing backtracking to find all palindrome partitions of a string, and subsets.py with two backtracking approaches to generate all subsets of a list. Both solutions include time and space complexity comments and have been tested on Leetcode.

[super30admin]

• Strengths:
  • The student demonstrates a strong understanding of backtracking and recursion.
  • The code is clean, well-commented, and easy to follow.
  • Both approaches (01 recursion and iterative recursion) are correctly implemented for the subsets problem.
• Areas for Improvement:
  • For the palindrome partitioning problem, consider adding a memoization step to cache palindrome checks for substrings that have already been checked. This could improve performance for larger inputs.
  • The space complexity analysis could be more detailed, explaining why it is O(n^2) in terms of the recursion stack and path copies.