Added 1 solution & modified 2 solutions

varunu28 · varunu28 · commit edf31b0613f6 · 2020-02-18T05:55:58.000-08:00
diff --git a/Easy/Intersection of Three Sorted Arrays.java b/Easy/Intersection of Three Sorted Arrays.java
@@ -0,0 +1,21 @@
+class Solution {
+  public List<Integer> arraysIntersection(int[] arr1, int[] arr2, int[] arr3) {
+    int[] counter = new int[2001];
+    updateCounter(counter, arr1);
+    updateCounter(counter, arr2);
+    updateCounter(counter, arr3);
+    List<Integer> ans = new ArrayList<>();
+    for (int i = 0; i < 2001; i++) {
+      if (counter[i] == 3) {
+        ans.add(i);
+      }
+    }
+    return ans;
+  }
+  
+  private void updateCounter(int[] counter, int[] arr) {
+    for (int num : arr) {
+      counter[num]++;
+    }
+  }
+}
diff --git a/Easy/N-Repeated Element in Size 2N Array.java b/Easy/N-Repeated Element in Size 2N Array.java
@@ -1,15 +1,13 @@
 class Solution {
-    public int repeatedNTimes(int[] A) {
-        int maxCounter = A.length / 2;
-        Map<Integer, Integer> map = new HashMap<>();
-        for (int num : A) {
-            map.put(num, map.getOrDefault(num, 0) + 1);
-            
-            if (map.get(num) == maxCounter) {
-                return num;
-            }
-        }
-        
-        return -1;
+  public int repeatedNTimes(int[] A) {
+    Map<Integer, Integer> map = new HashMap<>();
+    int n = A.length / 2;
+    for (int num : A) {
+      map.put(num, map.getOrDefault(num, 0) + 1);
+      if (map.get(num) == n) {
+        return num;
+      }
     }
+    return -1;
+  }
 }
diff --git a/Easy/Subdomain Visit Count.java b/Easy/Subdomain Visit Count.java
@@ -1,31 +1,22 @@
 class Solution {
-    public List<String> subdomainVisits(String[] cpdomains) {
-        Map<String, Integer> map = new HashMap<>();
-        
-        for (String s : cpdomains) {
-            String[] strs = s.split("\\s+");
-            int count = Integer.parseInt(strs[0]);
-            String[] domains = strs[1].split("\\.");
-            
-            String temp = domains[domains.length-1];
-            int domainLen = domains.length-1;
-            
-            while(domainLen >= 0) {
-                map.put(temp, map.getOrDefault(temp, 0) + count);
-                if (domainLen > 0) {
-                	temp = domains[domainLen-1] + "." + temp;
-                }
-                domainLen--;
-            }
-            
+  public List<String> subdomainVisits(String[] cpdomains) {
+    Map<String, Integer> map = new HashMap<>();
+    for(String domain : cpdomains) {
+      int count = Integer.parseInt(domain.split("\\s+")[0]);
+      String[] subDomains = domain.split("\\s+")[1].split("\\.");
+      StringBuilder sb = new StringBuilder();
+      for (int i = subDomains.length - 1; i >= 0; i--) {
+        if (sb.length() != 0) {
+          sb.insert(0, ".");
         }
-        
-        List<String> ans = new ArrayList<>();
-        for (Map.Entry<String, Integer> entry : map.entrySet()) {
-            String str = String.valueOf(entry.getValue()) + " " + entry.getKey();
-            ans.add(str);
-        }
-        
-        return ans;
+        sb.insert(0, subDomains[i]);
+        map.put(sb.toString(), map.getOrDefault(sb.toString(), 0) + count);
+      }
+    }
+    List<String> list = new ArrayList<>();
+    for (String key : map.keySet()) {
+      list.add(map.get(key) + " " + key);
     }
+    return list;
+  }
 }
