substs

Striver Sheet/Day-12/Subsets.cpp

@@ -0,0 +1,42 @@
+/*
+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.
+
+Example 1:
+Input: nums = [1,2,3]
+Output: [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]
+
+Example 2:
+Input: nums = [0]
+Output: [[],[0]]
+
+Constraints:
+1 <= nums.length <= 10
+-10 <= nums[i] <= 10
+All the numbers of nums are unique.
+*/
+
+class Solution
+{
+public:
+  vector<vector<int>> subsets(vector<int> &nums)
+  {
+    vector<vector<int>> ans;
+    int n = nums.size(), p = pow(2, n);
+    for (int i = 0; i < p; ++i)
+    {
+      vector<int> arr;
+      for (int j = 0; j < n; ++j)
+      {
+        if ((i >> j) & 1)
+          arr.push_back(nums[j]);
+      }
+      ans.push_back(arr);
+    }
+    return ans;
+  }
+};

Striver Sheet/README.md

@@ -104,8 +104,8 @@
 
 - [Power of Two](https://leetcode.com/problems/power-of-two/) - [Cpp Soultion](./Day-12/Power%20of%20Two.cpp)
 - [Counting Bits](https://leetcode.com/problems/counting-bits/) - [Cpp Soultion](./Day-12/Counting%20Bits.cpp)
-- []() - [Cpp Soultion](./Day-12/.cpp)
-- []() - [Cpp Soultion](./Day-12/.cpp)
+- [Divide two integers without using multiplication, division and mod operator](https://www.geeksforgeeks.org/divide-two-integers-without-using-multiplication-division-mod-operator/)
+- [Subsets](https://leetcode.com/problems/subsets/) - [Cpp Soultion](./Day-12/Subsets.cpp)
 - []() - [Cpp Soultion](./Day-12/.cpp)
 - []() - [Cpp Soultion](./Day-12/.cpp)