Meesho SWE Interview Question 2024 October | Backtracking | on-campus

Question 1: Subsets Problem Statement Given an integer array nums of unique elements, return all possible subsets (the power set). The solution set must not contain duplicate subsets. Return the solution in any order. Constraints 1 <= nums.length <= 10 -10 <= nums[i] <= 10 All integers in nums are unique Examples Example 1: Input: nums = [1, 2, 3] Output: [[], [1], [2], [1,2], [3], [1,3], [2,3], [1,2,3]] Explanation 1: For 3 elements there are 2^3 = 8 subsets ...