Welcome to Day 5 of the DSA Coding Challenge:

Today's Goals (Backtracking continued) :

-Learn everything about Backtracking

Question 1: Subsets: Given an integer array of unique elements, return all possible subsets (the power set). The solution set must not contain duplicate subsets. Return the solution in any order.

Question 2: Subsets 2: Given an integer array nums that may contain duplicates, return all possible subsets (the power set). The solution set must not contain duplicate subsets. Return the solution in any order.

All the best !