From fcae14120aaa8419b70c428281f9d1123b851f87 Mon Sep 17 00:00:00 2001
From: Bala2it4u <bala.effie@gmail.com>
Date: Wed, 6 Apr 2022 17:58:14 +0530
Subject: [PATCH 01/10] Create 217. Contains Duplicate.java

---
 java/217. Contains Duplicate.java | 8 ++++++++
 1 file changed, 8 insertions(+)
 create mode 100644 java/217. Contains Duplicate.java

diff --git a/java/217. Contains Duplicate.java b/java/217. Contains Duplicate.java
new file mode 100644
index 000000000..4393505b4
--- /dev/null
+++ b/java/217. Contains Duplicate.java	
@@ -0,0 +1,8 @@
+public boolean containsDuplicate(int[] nums) {
+    Set<Integer> set = new HashSet<>(nums.length);
+    for (int x: nums) {
+        if (set.contains(x)) return true;
+        set.add(x);
+    }
+    return false;
+}

From 97a3877f853fd5c9bc411ce9069517fe70bef9ef Mon Sep 17 00:00:00 2001
From: Bala2it4u <bala.effie@gmail.com>
Date: Wed, 6 Apr 2022 17:59:06 +0530
Subject: [PATCH 02/10] Delete 217. Contains Duplicate.java

---
 java/217. Contains Duplicate.java | 8 --------
 1 file changed, 8 deletions(-)
 delete mode 100644 java/217. Contains Duplicate.java

diff --git a/java/217. Contains Duplicate.java b/java/217. Contains Duplicate.java
deleted file mode 100644
index 4393505b4..000000000
--- a/java/217. Contains Duplicate.java	
+++ /dev/null
@@ -1,8 +0,0 @@
-public boolean containsDuplicate(int[] nums) {
-    Set<Integer> set = new HashSet<>(nums.length);
-    for (int x: nums) {
-        if (set.contains(x)) return true;
-        set.add(x);
-    }
-    return false;
-}

From 8740b988a5f098bf108907361878d037983ce9b1 Mon Sep 17 00:00:00 2001
From: Bala2it4u <bala.effie@gmail.com>
Date: Wed, 6 Apr 2022 18:00:48 +0530
Subject: [PATCH 03/10] Update 217-Contains-Duplicate.js

we can you set in javascript
---
 javascript/217-Contains-Duplicate.js | 15 ++++++---------
 1 file changed, 6 insertions(+), 9 deletions(-)

diff --git a/javascript/217-Contains-Duplicate.js b/javascript/217-Contains-Duplicate.js
index 3c96a1b20..10e1f847f 100644
--- a/javascript/217-Contains-Duplicate.js
+++ b/javascript/217-Contains-Duplicate.js
@@ -3,14 +3,11 @@
  * @return {boolean}
  */
 var containsDuplicate = function(nums) {
-    let map = {};
-    
-    for (let i = 0; i < nums.length; i++) {
-        if (nums[i] in map) {
-            return true;
-        } else {
-            map[nums[i]] = i;
-        }
+    let map = new Set();
+    for (let idx=0;idx<nums.length;idx++){
+        if (map.has(nums[idx])) return true;
+            
+        map.add(nums[idx]);
     }
-    return false;
+     return false;
 };

From 9fd40286cc811e495bf87e42647b52eb8751c3a8 Mon Sep 17 00:00:00 2001
From: Bala2it4u <bala.effie@gmail.com>
Date: Thu, 7 Apr 2022 17:10:59 +0530
Subject: [PATCH 04/10] Create 49. Group Anagrams.java

---
 java/49. Group Anagrams.java | 30 ++++++++++++++++++++++++++++++
 1 file changed, 30 insertions(+)
 create mode 100644 java/49. Group Anagrams.java

diff --git a/java/49. Group Anagrams.java b/java/49. Group Anagrams.java
new file mode 100644
index 000000000..f633c27d9
--- /dev/null
+++ b/java/49. Group Anagrams.java	
@@ -0,0 +1,30 @@
+class Solution {
+    HashMap<String, List<String>> map = new HashMap<>();
+    
+    public List<List<String>> groupAnagrams(String[] strs) {
+        
+        for (int idx=0;idx<strs.length;idx++){
+            process(strs[idx]);
+        }
+        
+        return new ArrayList<List<String>>(map.values());
+    }
+    
+    public void process(String data){
+        int[] az= new int[26];
+        
+        for (int idx=0;idx<data.length();idx++){
+            az[data.charAt(idx)-'a'] += 1;
+        }
+        StringBuilder result = new StringBuilder();
+        for (int idx=0;idx<26;idx++){
+            if (az[idx] == 0) continue;
+            
+            result.append(idx+"-"+az[idx]);
+        }
+        String out = result.toString();
+        if (!map.containsKey(out)) map.put(out, new ArrayList());
+        
+        map.get(out).add(data);
+    }
+}

From a07bc37fc976686a116fa11a120a4722278c8bbc Mon Sep 17 00:00:00 2001
From: Bala2it4u <bala.effie@gmail.com>
Date: Thu, 7 Apr 2022 17:20:24 +0530
Subject: [PATCH 05/10] Update 217-Contains-Duplicate.js

---
 javascript/217-Contains-Duplicate.js | 15 +++++++++------
 1 file changed, 9 insertions(+), 6 deletions(-)

diff --git a/javascript/217-Contains-Duplicate.js b/javascript/217-Contains-Duplicate.js
index 10e1f847f..3c96a1b20 100644
--- a/javascript/217-Contains-Duplicate.js
+++ b/javascript/217-Contains-Duplicate.js
@@ -3,11 +3,14 @@
  * @return {boolean}
  */
 var containsDuplicate = function(nums) {
-    let map = new Set();
-    for (let idx=0;idx<nums.length;idx++){
-        if (map.has(nums[idx])) return true;
-            
-        map.add(nums[idx]);
+    let map = {};
+    
+    for (let i = 0; i < nums.length; i++) {
+        if (nums[i] in map) {
+            return true;
+        } else {
+            map[nums[i]] = i;
+        }
     }
-     return false;
+    return false;
 };

From 9fd2c6561d6527570e419d5336e81fb42b20f37a Mon Sep 17 00:00:00 2001
From: Bala2it4u <bala.effie@gmail.com>
Date: Fri, 8 Apr 2022 17:04:58 +0530
Subject: [PATCH 06/10] Create 347TopKFrequentElements..java

---
 java/347TopKFrequentElements..java | 40 ++++++++++++++++++++++++++++++
 1 file changed, 40 insertions(+)
 create mode 100644 java/347TopKFrequentElements..java

diff --git a/java/347TopKFrequentElements..java b/java/347TopKFrequentElements..java
new file mode 100644
index 000000000..a48857cf3
--- /dev/null
+++ b/java/347TopKFrequentElements..java
@@ -0,0 +1,40 @@
+class Solution {
+    public int[] topKFrequent(int[] nums, int k) {
+        //hashmap, check count == k, add to result
+        //List<Integer> result = new ArrayList();
+        HashMap<Integer, Integer> map = new HashMap();
+        //int max = 0;
+        
+        for (int idx=0;idx<nums.length;idx++){
+            int num = nums[idx];
+            
+            map.put(num, map.getOrDefault(num,0)+1);
+            
+            //max = Math.max(max, map.get(num));
+        }
+        List<Integer> set = new ArrayList<Integer>(map.keySet());
+        List<Integer>[] out = new List[nums.length+1];
+        
+        for (int idx=0;idx<set.size();idx++){
+            int count = map.get(set.get(idx));
+            
+            //if (count )
+            if (out[count] == null)out[count] = new ArrayList<Integer>();
+            
+            out[count].add(set.get(idx));
+        }
+        
+        int[] result = new int[k];
+        int i=0;
+        for (int idx=out.length-1;i<k;idx--) {
+            if (out[idx] == null) continue;
+        
+            for (Integer temp : out[idx]){
+                if (i>=k) break;
+                
+                result[i++]= temp;
+            }
+        }
+        return result;
+    }
+}

From c105d97ca0deb2500817adee939896710ced0f50 Mon Sep 17 00:00:00 2001
From: Bala2it4u <bala.effie@gmail.com>
Date: Fri, 27 May 2022 17:45:37 +0530
Subject: [PATCH 07/10] Create 853. Car Fleet.java

---
 java/853. Car Fleet.java | 32 ++++++++++++++++++++++++++++++++
 1 file changed, 32 insertions(+)
 create mode 100644 java/853. Car Fleet.java

diff --git a/java/853. Car Fleet.java b/java/853. Car Fleet.java
new file mode 100644
index 000000000..f1e0d2c15
--- /dev/null
+++ b/java/853. Car Fleet.java	
@@ -0,0 +1,32 @@
+class Solution {
+    public int carFleet(int target, int[] position, int[] speed) {
+        double[][] mergedPoints = new double[position.length][2];
+        for (int idx=0;idx<position.length;idx++){
+            mergedPoints[idx][0] = position[idx];
+            mergedPoints[idx][1] = speed[idx];            
+        }
+        Arrays.sort(mergedPoints, Comparator.comparingDouble(o -> -o[0]));
+        Stack<Double> backup = new Stack();
+        for (int idx=0;idx<position.length;idx++){
+            
+            double _position = mergedPoints[idx][0];
+            double _speed = mergedPoints[idx][1];
+            
+            //System.out.println("_position : " + _position);
+            
+            double _timeTaken = (target-_position)/_speed;
+            double _lastValue = 0;
+            if (!backup.isEmpty()){
+                _lastValue = backup.peek();
+            }
+            backup.push(_timeTaken);
+            //System.out.println(_timeTaken +"<="+ _lastValue +" is true :" + (_timeTaken <= _lastValue));
+            if (backup.size()>1 && 
+                _timeTaken <= _lastValue){
+                backup.pop();
+            }
+        }
+        return backup.size();
+        
+    }
+}

From 63b164a75b64d3d368a9c8fbab771a518e94c7ec Mon Sep 17 00:00:00 2001
From: Bala2it4u <bala.effie@gmail.com>
Date: Fri, 27 May 2022 18:01:29 +0530
Subject: [PATCH 08/10] Delete 217-Contains-Duplicate.js

---
 javascript/217-Contains-Duplicate.js | 16 ----------------
 1 file changed, 16 deletions(-)
 delete mode 100644 javascript/217-Contains-Duplicate.js

diff --git a/javascript/217-Contains-Duplicate.js b/javascript/217-Contains-Duplicate.js
deleted file mode 100644
index 3c96a1b20..000000000
--- a/javascript/217-Contains-Duplicate.js
+++ /dev/null
@@ -1,16 +0,0 @@
-/**
- * @param {number[]} nums
- * @return {boolean}
- */
-var containsDuplicate = function(nums) {
-    let map = {};
-    
-    for (let i = 0; i < nums.length; i++) {
-        if (nums[i] in map) {
-            return true;
-        } else {
-            map[nums[i]] = i;
-        }
-    }
-    return false;
-};

From 1f5a69df6a36b94ec12193463a21868474df9bc9 Mon Sep 17 00:00:00 2001
From: Bala2it4u <bala.effie@gmail.com>
Date: Fri, 27 May 2022 18:04:30 +0530
Subject: [PATCH 09/10] Delete 49. Group Anagrams.java

---
 java/49. Group Anagrams.java | 30 ------------------------------
 1 file changed, 30 deletions(-)
 delete mode 100644 java/49. Group Anagrams.java

diff --git a/java/49. Group Anagrams.java b/java/49. Group Anagrams.java
deleted file mode 100644
index f633c27d9..000000000
--- a/java/49. Group Anagrams.java	
+++ /dev/null
@@ -1,30 +0,0 @@
-class Solution {
-    HashMap<String, List<String>> map = new HashMap<>();
-    
-    public List<List<String>> groupAnagrams(String[] strs) {
-        
-        for (int idx=0;idx<strs.length;idx++){
-            process(strs[idx]);
-        }
-        
-        return new ArrayList<List<String>>(map.values());
-    }
-    
-    public void process(String data){
-        int[] az= new int[26];
-        
-        for (int idx=0;idx<data.length();idx++){
-            az[data.charAt(idx)-'a'] += 1;
-        }
-        StringBuilder result = new StringBuilder();
-        for (int idx=0;idx<26;idx++){
-            if (az[idx] == 0) continue;
-            
-            result.append(idx+"-"+az[idx]);
-        }
-        String out = result.toString();
-        if (!map.containsKey(out)) map.put(out, new ArrayList());
-        
-        map.get(out).add(data);
-    }
-}

From 67dabb9208e14f2df1631d557ee2e5e0204904ff Mon Sep 17 00:00:00 2001
From: Bala2it4u <bala.effie@gmail.com>
Date: Fri, 27 May 2022 18:05:33 +0530
Subject: [PATCH 10/10] Delete 347TopKFrequentElements..java

---
 java/347TopKFrequentElements..java | 40 ------------------------------
 1 file changed, 40 deletions(-)
 delete mode 100644 java/347TopKFrequentElements..java

diff --git a/java/347TopKFrequentElements..java b/java/347TopKFrequentElements..java
deleted file mode 100644
index a48857cf3..000000000
--- a/java/347TopKFrequentElements..java
+++ /dev/null
@@ -1,40 +0,0 @@
-class Solution {
-    public int[] topKFrequent(int[] nums, int k) {
-        //hashmap, check count == k, add to result
-        //List<Integer> result = new ArrayList();
-        HashMap<Integer, Integer> map = new HashMap();
-        //int max = 0;
-        
-        for (int idx=0;idx<nums.length;idx++){
-            int num = nums[idx];
-            
-            map.put(num, map.getOrDefault(num,0)+1);
-            
-            //max = Math.max(max, map.get(num));
-        }
-        List<Integer> set = new ArrayList<Integer>(map.keySet());
-        List<Integer>[] out = new List[nums.length+1];
-        
-        for (int idx=0;idx<set.size();idx++){
-            int count = map.get(set.get(idx));
-            
-            //if (count )
-            if (out[count] == null)out[count] = new ArrayList<Integer>();
-            
-            out[count].add(set.get(idx));
-        }
-        
-        int[] result = new int[k];
-        int i=0;
-        for (int idx=out.length-1;i<k;idx--) {
-            if (out[idx] == null) continue;
-        
-            for (Integer temp : out[idx]){
-                if (i>=k) break;
-                
-                result[i++]= temp;
-            }
-        }
-        return result;
-    }
-}