Subsets

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.

LeetCode Problem - 78

class Solution {
    // Method to generate all possible subsets of a given set of integers
    public List<List<Integer>> subsets(int[] nums) {
        // Initialize the result list to store all subsets
        List<List<Integer>> resultList = new ArrayList<>();
        // Initialize a temporary list to store the current subset
        List<Integer> tempList = new ArrayList<>();

        // Call the backtrack method to generate subsets
        backTrack(resultList, tempList, nums, 0);
        // Return the list of all subsets
        return resultList;
    }

    // Helper method to perform backtracking to generate subsets
    public void backTrack(List<List<Integer>> resultList, List<Integer> tempSet, int[] nums, int start) {
        // Add the current subset to the result list
        resultList.add(new ArrayList<>(tempSet));

        // Iterate over the elements starting from 'start' to the end of the array
        for(int i = start; i < nums.length; i++) {
            // Include nums[i] in the current subset
            tempSet.add(nums[i]);
            // Recursively generate subsets including the current element
            backTrack(resultList, tempSet, nums, i + 1);
            // Remove the last element to backtrack and generate other subsets
            tempSet.remove(tempSet.size() - 1);
        }
    }
}