feat: added find subsets algorithm using bitmanipulation

Bit-Manipulation/GenerateSubSets.js

@@ -8,7 +8,7 @@
 // The time complexity of this algorithm is BigO(2^n) where n is the length of array
 function generateSubSets(inputArray) {
   if (!Array.isArray(inputArray)) {
-    throw new TypeError('Provided input is not an array')
+    throw new Error('Provided input is not an array')
   }
   if (inputArray.length > 32) {
     throw new RangeError('Error size should be less than equal to 32')

Bit-Manipulation/test/GenerateSubSets.test.js

@@ -1,4 +1,3 @@
-import { expect } from 'vitest'
 import { generateSubSets } from '../GenerateSubSets'
 
 describe('subSets', () => {
@@ -14,5 +13,24 @@ describe('subSets', () => {
       [1, 2, 3]
     ])
     expect(generateSubSets([1, 2])).toEqual([[], [1], [2], [1, 2]])
+    expect(generateSubSets([1, 2, 3])).toEqual([
+      [],
+      [1],
+      [2],
+      [1, 2],
+      [3],
+      [1, 3],
+      [2, 3],
+      [1, 2, 3]
+    ])
+    expect(() => generateSubSets('invalid')).toThrow(
+      'Provided input is not an array'
+    )
+    expect(() =>
+      generateSubSets([
+        1, 2, 2, 1, 2, 3, 4, 3, 2, 3, 4, 3, 2, 2, 2, 3, 12, 11, 4, 2, 2, 2, 2,
+        1, 2, 3, 5, 6, 7, 7, 8, 6, 5, 6, 7, 8, 9, 8, 0, 6
+      ])
+    ).toThrow('Error size should be less than equal to 32')
   })
 })