Subsets - https://leetcode.com/problems/subsets/description/

gistfile1.txt

class Solution {
    public List<List<Integer>> subsets(int[] nums) {
      // check
      if (nums == null) {
        throw new IllegalArgumentException();
      }
      
      List<List<Integer>> results = new LinkedList<List<Integer>>();
      
      // prepare to recursive
      List<Integer> prefix = new LinkedList<Integer>();
      
      // lets recursive to process all
      recursiveSubset(nums, 0, prefix, results);
      
      return results;
      
    }
  
    private void recursiveSubset(int[] nums, int index, List<Integer> prefix, List<List<Integer>> results) {
      
      // stopping criteria
      if (index > nums.length) {
        return;
      }
      
      // Process the prefix b4 we modify
      results.add(new LinkedList<Integer>(prefix));
      
      for (int i = index; i < nums.length; i++) {
        int curNum = nums[i];
        
        prefix.add(curNum);
        recursiveSubset(nums, i + 1, prefix, results);
        
        // remove last prefix;
        prefix.remove(prefix.size() - 1);
      }
    }
}

Subsets II - No DUplicate

public class Solution {
    public List<List<Integer>> subsetsWithDup(int[] nums) {
        Arrays.sort(nums);
        List<List<Integer>> result= new ArrayList<>();
        dfs(nums, 0, new ArrayList<Integer>(), result);
        return result;
    }
    
    private void dfs(int[] nums, int index, List<Integer> path, List<List<Integer>> result) {
        // stopping criteria
        if (index > nums.length) {
          return;
        }
        result.add(path);

        for(int i = index; i < nums.length; i++) {
            // Check duplicate
            if( i > index && nums[i]==nums[i-1]) {
                continue;
            }
            
            List<Integer> nPath= new ArrayList<>(path);
            nPath.add(nums[i]);
            
            dfs(nums, i+1, nPath, result);
        }
    }
}

https://leetcode.com/problems/subsets/discuss/27281/A-general-approach-to-backtracking-questions-in-Java-(Subsets-Permutations-Combination-Sum-Palindrome-Partitioning)