Added 2 solutions

varunu28 · varunu28 · commit 13dfde95758e · 2019-12-08T09:49:26.000-08:00
diff --git a/Easy/Subtract the Product and Sum of Digits of an Integer.java b/Easy/Subtract the Product and Sum of Digits of an Integer.java
@@ -0,0 +1,26 @@
+class Solution {
+    public int subtractProductAndSum(int n) {
+        return getProduct(n) - getSum(n);
+    }
+    
+    private int getProduct(int n) {
+        if (n == 0) {
+            return 0;
+        }
+        int fact = 1;
+        while (n > 0) {
+            fact *= n % 10;
+            n /= 10;
+        }
+        return fact;
+    }
+    
+    private int getSum(int n) {
+        int sum = 0;
+        while (n > 0) {
+            sum += n % 10;
+            n /= 10;
+        }
+        return sum;
+    }
+}
diff --git a/Medium/Group the People Given the Group Size They Belong To.java b/Medium/Group the People Given the Group Size They Belong To.java
@@ -0,0 +1,27 @@
+class Solution {
+    public List<List<Integer>> groupThePeople(int[] groupSizes) {
+        Map<Integer, List<List<Integer>>> map = new HashMap<>();
+        int n = groupSizes.length;
+        for (int i = 0; i < n; i++) {
+            int size = groupSizes[i];
+            if (!map.containsKey(size)) {
+                map.put(size, new ArrayList<>());
+                map.get(size).add(new ArrayList<>());
+            }
+            int arraySize = map.get(size).size();
+            if (map.get(size).get(arraySize - 1).size() == size) {
+                map.get(size).add(new ArrayList<>());
+                arraySize++;
+            }
+            map.get(size).get(arraySize - 1).add(i);
+        }
+        List<List<Integer>> ans = new ArrayList<>();
+        for (Integer key : map.keySet()) {
+            List<List<Integer>> lists = map.get(key);
+            for (List<Integer> list : lists) {
+                ans.add(list);
+            }
+        }
+        return ans;
+    }
+}
