Added 2 solutions

varunu28 · varunu28 · commit f414760478e9 · 2019-09-04T19:25:58.000-07:00
diff --git a/Easy/Compare Strings by Frequency of the Smallest Character.java b/Easy/Compare Strings by Frequency of the Smallest Character.java
@@ -0,0 +1,45 @@
+class Solution {
+    public int[] numSmallerByFrequency(String[] queries, String[] words) {
+        List<Integer> list = new ArrayList<>();
+        for (String word : words) {
+            list.add(getMinWordFreq(word));
+        }
+        Collections.sort(list);
+        int[] ans = new int[queries.length];
+        for (int i = 0; i < queries.length; i++) {
+            int minCount = getMinWordFreq(queries[i]);
+            int idx = 0;
+            ans[i] = binarySearch(minCount, list);
+        }
+        return ans;
+    }
+    
+    private int binarySearch(int target, List<Integer> list) {
+        int left = 0;
+        int right = list.size() - 1;
+        while (left <= right) {
+            int mid = (left + right) / 2;
+            if (list.get(mid) <= target) {
+                left = mid + 1;
+            }
+            else {
+                right = mid - 1;
+            }
+        }
+        
+        return list.size() - left;
+    }
+    
+    private int getMinWordFreq(String word) {
+        int[] counter = new int[26];
+        for (char c : word.toCharArray()) {
+            counter[c - 'a']++;
+        }
+        for (int i = 0; i < 26; i++) {
+            if (counter[i] != 0) {
+                return counter[i];
+            }
+        }
+        return 0;
+    }
+}
diff --git a/Easy/Diet Plan Performance.java b/Easy/Diet Plan Performance.java
@@ -0,0 +1,27 @@
+class Solution {
+    int points;
+    public int dietPlanPerformance(int[] calories, int k, int lower, int upper) {
+        points = 0;
+        int totalCal = 0;
+        int start = 0;
+        for (int i = 0; i < k; i++) {
+            totalCal += calories[i];
+        }
+        for (int i = k; i < calories.length; i++) {    
+            updatePoints(totalCal, lower, upper);
+            totalCal -= calories[start++];
+            totalCal += calories[i];
+        }
+        updatePoints(totalCal, lower, upper);
+        return points;
+    }
+    
+    private void updatePoints(int currCal, int lower, int upper) {
+        if (currCal < lower) {
+            points--;
+        }
+        if (currCal > upper) {
+            points++;
+        }
+    }
+}
