Added :Subsets

Author: rohitkumar-rk

LeetCode/Array/78. Subsets/Problem Statement.txt

@@ -0,0 +1,18 @@
+Given a set of distinct integers, nums, return all possible subsets (the power set).
+
+Note: The solution set must not contain duplicate subsets.
+
+Example:
+
+Input: nums = [1,2,3]
+Output:
+[
+  [3],
+  [1],
+  [2],
+  [1,2,3],
+  [1,3],
+  [2,3],
+  [1,2],
+  []
+]

LeetCode/Array/78. Subsets/Solution.java

@@ -0,0 +1,30 @@
+/**
+
+@lc id : 78
+@problem : Subsets
+@author : github.com/rohitkumar-rk
+@url : https://leetcode.com/problems/subsets/
+@difficulty : medium
+*/
+
+class Solution {
+    
+    public void  subsetsHelper(int currIndex, int nums[], ArrayList<Integer> currSubset,
+                               List<List<Integer>> subsets){
+        
+        subsets.add(new ArrayList<>(currSubset));
+        
+        for(int i = currIndex; i < nums.length; i++){
+            currSubset.add(nums[i]);
+            subsetsHelper(i+1, nums, currSubset, subsets);
+            currSubset.remove(currSubset.size() - 1);
+        }
+        
+    }
+    
+    public List<List<Integer>> subsets(int[] nums) {
+        List<List<Integer>> subsets = new ArrayList<>();
+        subsetsHelper(0, nums, new ArrayList(), subsets);
+        return subsets;
+    }
+}