Added 2 solutions & refactored 2 solutions

varunu28 · varunu28 · commit 087ddb0c5ec3 · 2020-01-03T05:51:13.000-08:00
diff --git a/Easy/How Many Apples Can You Put into the Basket.java b/Easy/How Many Apples Can You Put into the Basket.java
@@ -1,15 +1,12 @@
 class Solution {
-    public int maxNumberOfApples(int[] arr) {
-        Arrays.sort(arr);
-        int total = 0;
-        int count = 0;
-        for (int i = 0; i < arr.length; i++) {
-            total += arr[i];
-            if (total > 5000) {
-                break;
-            }
-            count++;
-        }
-        return count;
+  public int maxNumberOfApples(int[] arr) {
+    int weight = 0;
+    int currCount = 0;
+    Arrays.sort(arr);
+    for (int i = 0; i < arr.length && weight + arr[i] <= 5000; i++) {
+      weight += arr[i];
+      currCount++;
     }
+    return currCount;
+  }
 }
diff --git a/Easy/Sort Array By Parity.java b/Easy/Sort Array By Parity.java
@@ -0,0 +1,20 @@
+class Solution {
+  public int[] sortArrayByParity(int[] A) {
+    int start = 0;
+    int end = A.length - 1;
+    while (start < end) {
+      if (A[start] % 2 > A[end] % 2) {
+        int temp = A[start];
+        A[start] = A[end];
+        A[end] = temp;
+      }
+      if (A[start] % 2 == 0) {
+        start++;
+      }
+      if (A[end] % 2 != 0) {
+        end--;
+      }
+    }
+    return A;
+  }
+}
diff --git a/Medium/Boundary of Binary Tree.java b/Medium/Boundary of Binary Tree.java
@@ -8,58 +8,50 @@
  * }
  */
 class Solution {
-    List<Integer> list;
-    int backIdx;
-    public List<Integer> boundaryOfBinaryTree(TreeNode root) {
-        list = new ArrayList<>();
-        backIdx = 0;
-        
-        if (root == null) {
-            return list;
-        }
-        
-        list.add(root.val);
-        
-        addLeft(root.left);
-        addLeaves(root.left);
-        addLeaves(root.right);
-        addRight(root.right);
-        
-        return list;
+  public List<Integer> boundaryOfBinaryTree(TreeNode root) {
+    List<Integer> list = new ArrayList<>();
+    List<Integer> right = new ArrayList<>();
+    if (root == null) {
+      return list;
     }
-    
-    private void addLeft(TreeNode node) {
-        if (node == null || (node.left == null && node.right == null)) {
-            return;
-        }
-        
-        list.add(node.val);
-        
-        addLeft(node.left == null ? node.right : node.left);
+    list.add(root.val);
+    addLeft(root.left, list);
+    addLeaves(root.left, list);
+    addLeaves(root.right, list);
+    addRight(root.right, right);
+    for (int i = right.size() - 1; i >= 0; i--) {
+      list.add(right.get(i));
     }
-    
-    private void addRight(TreeNode node) {
-        if (node == null || (node.right == null && node.left == null)) {
-            return;
-        }
-        
-        list.add(list.size() - backIdx, node.val);
-        backIdx++;
-        
-        addRight(node.right == null ? node.left : node.right);
+    return list;
+  }
+  
+  private void addLeft(TreeNode root, List<Integer> list) {
+    if (root == null || (root.left == null && root.right == null)) {
+      return;
     }
-    
-    private void addLeaves(TreeNode node) {
-        if (node == null) {
-            return;
-        }
-        
-        if (node.left == null && node.right == null) {
-            list.add(node.val);    
-            return;
-        } 
-        
-        addLeaves(node.left);
-        addLeaves(node.right);
+    list.add(root.val);
+    addLeft(root.left == null ? root.right : root.left, list);
+  }
+  
+  private void addRight(TreeNode root, List<Integer> list) {
+    if (root == null || (root.left == null && root.right == null)) {
+      return;
     }
+    list.add(root.val);
+    TreeNode next = root.right == null ? root.left : root.right;
+    addRight(root.right == null ? root.left : root.right, list);
+  }
+  
+  private void addLeaves(TreeNode root, List<Integer> list) {
+    if (root == null) {
+      return;
+    }
+    if (root.left == null && root.right == null) {
+      list.add(root.val);
+    }
+    else {
+      addLeaves(root.left, list);
+      addLeaves(root.right, list);
+    }
+  }
 }
diff --git a/Medium/Search Suggestions System.java b/Medium/Search Suggestions System.java
@@ -0,0 +1,36 @@
+class Solution {
+  public List<List<String>> suggestedProducts(String[] products, String searchWord) {
+    List<List<String>> ans = new ArrayList<>();
+    List<String> prev = new ArrayList<>();
+    for (int i = 0; i < searchWord.length(); i++) {
+      List<String> curr = new ArrayList<>();
+      List<String> temp = new ArrayList<>();
+      PriorityQueue<String> pq = new PriorityQueue<>(Comparator.reverseOrder());
+      if (i == 0) {
+        helper(Arrays.asList(products), searchWord, i, curr, pq);
+      }
+      else {
+        helper(prev, searchWord, i, curr, pq);
+      }
+      while (!pq.isEmpty()) {
+        temp.add(pq.poll());
+      }
+      Collections.sort(temp);
+      ans.add(temp);
+      prev = curr;
+    }
+    return ans;
+  }
+
+  private void helper(List<String> products, String searchWord, int i, List<String> curr, PriorityQueue<String> pq) {
+    for (String word : products) {
+      if (i < word.length() && word.charAt(i) == searchWord.charAt(i)) {
+        curr.add(word);
+        pq.add(word);
+        if (pq.size() > 3) {
+          pq.poll();
+        }
+      }
+    }
+  }
+}
