Merge branch 'neetcode-gh:main' into main

itsmohitnarayan · web-flow · commit 575e04c00b1a · 2024-01-12T10:37:14.000+05:30
diff --git a/README.md b/README.md
@@ -141,7 +141,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[0225 - Implement Stack Using Queues](https://leetcode.com/problems/implement-stack-using-queues/)</sub> | <sub><div align='center'>[✔️](c%2F0225-implement-stack-using-queues.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0225-implement-stack-using-queues.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0225-implement-stack-using-queues.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0225-implement-stack-using-queues.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0225-implement-stack-using-queues.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0225-implement-stack-using-queues.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0225-implement-stack-using-queues.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0225-implement-stack-using-queues.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0225-implement-stack-using-queues.ts)</div></sub>
 <sub>[0155 - Min Stack](https://leetcode.com/problems/min-stack/)</sub> | <sub><div align='center'>[✔️](c%2F0155-min-stack.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0155-min-stack.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0155-min-stack.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0155-min-stack.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0155-min-stack.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0155-min-stack.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0155-min-stack.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0155-min-stack.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0155-min-stack.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0155-min-stack.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0155-min-stack.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0155-min-stack.ts)</div></sub>
 <sub>[0150 - Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/)</sub> | <sub><div align='center'>[✔️](c%2F0150-evaluate-reverse-polish-notation.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0150-evaluate-reverse-polish-notation.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0150-evaluate-reverse-polish-notation.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0150-evaluate-reverse-polish-notation.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0150-evaluate-reverse-polish-notation.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0150-evaluate-reverse-polish-notation.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0150-evaluate-reverse-polish-notation.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0150-evaluate-reverse-polish-notation.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0150-evaluate-reverse-polish-notation.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0150-evaluate-reverse-polish-notation.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0150-evaluate-reverse-polish-notation.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0150-evaluate-reverse-polish-notation.ts)</div></sub>
-<sub>[2390 - Removing Stars From a String](https://leetcode.com/problems/removing-stars-from-a-string/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F2390-removing-stars-from-a-string.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F2390-removing-stars-from-a-string.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F2390-removing-stars-from-a-string.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F2390-removing-stars-from-a-string.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
+<sub>[2390 - Removing Stars From a String](https://leetcode.com/problems/removing-stars-from-a-string/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F2390-removing-stars-from-a-string.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F2390-removing-stars-from-a-string.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F2390-removing-stars-from-a-string.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F2390-removing-stars-from-a-string.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F2390-removing-stars-from-a-string.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0946 - Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0946-validate-stack-sequences.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0946-validate-stack-sequences.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0946-validate-stack-sequences.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0022 - Generate Parentheses](https://leetcode.com/problems/generate-parentheses/)</sub> | <sub><div align='center'>[✔️](c%2F0022-generate-parentheses.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0022-generate-parentheses.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0022-generate-parentheses.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0022-generate-parentheses.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0022-generate-parentheses.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0022-generate-parentheses.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0022-generate-parentheses.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0022-generate-parentheses.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0022-generate-parentheses.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0022-generate-parentheses.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0022-generate-parentheses.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0022-generate-parentheses.ts)</div></sub>
 <sub>[0735 - Asteroid Collision](https://leetcode.com/problems/asteroid-collision/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0735-asteroid-collision.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0735-asteroid-collision.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0735-asteroid-collision.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0735-asteroid-collision.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0735-asteroid-collision.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0735-asteroid-collision.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0735-asteroid-collision.ts)</div></sub>
diff --git a/cpp/2390-removing-stars-from-a-string.cpp b/cpp/2390-removing-stars-from-a-string.cpp
@@ -0,0 +1,18 @@
+class Solution {
+public:
+    string removeStars(string s) {
+        stack<char> stk;
+        for(int i=0;i<s.size();i++){
+            if(s[i]=='*'){
+                stk.pop();
+            }else stk.push(s[i]);
+        }
+        string res = "";
+        while(!stk.empty()){
+            res += stk.top();
+            stk.pop();
+        }
+         reverse(res.begin(), res.end());
+         return res;
+    }
+};
diff --git a/java/0872-leaf-similar-trees.java b/java/0872-leaf-similar-trees.java
@@ -0,0 +1,17 @@
+class Solution {
+    public boolean leafSimilar(TreeNode root1, TreeNode root2) {
+        ArrayList<Integer> ls1 = new ArrayList<>();
+        ArrayList<Integer> ls2 = new ArrayList<>();
+        tree(root1, ls1);
+        tree(root2, ls2);
+        return ls1.equals(ls2);
+    }
+    private void tree(TreeNode root, List<Integer> ls){
+        if(root == null)
+            return;
+        if(root.left == null && root.right == null)
+            ls.add(root.val);
+        tree(root.left, ls);
+        tree(root.right, ls);        
+    }
+}
diff --git a/java/2385-amount-of-time-for-binary-tree-to-be-infected.java b/java/2385-amount-of-time-for-binary-tree-to-be-infected.java
@@ -0,0 +1,56 @@
+/*--------------------------
+  Time Complexity: O(n)
+  Space Complexity: O(n)
+---------------------------*/  
+class Solution {
+    public int amountOfTime(TreeNode root, int start) {
+        Map<Integer, List<Integer>> g = treeTograph(root);
+        int time = 0;
+        Queue<Integer> q = new LinkedList<>();
+        Set<Integer> visited = new HashSet<>();
+        q.add(start);
+        visited.add(start);
+
+        while(!q.isEmpty()){
+            int size = q.size(); 
+            for (int i = 0; i < size; i++) {
+                int curr = q.poll();
+                for (int neighbour : g.get(curr)) {
+                    if (!visited.contains(neighbour)) {
+                        q.add(neighbour);
+                        visited.add(neighbour);
+                    }
+                }
+            }
+            time++;
+        }
+        return time-1;
+    }
+    public HashMap<Integer, List<Integer>> treeTograph(TreeNode root) {
+        HashMap<Integer, List<Integer>> graph = new HashMap<>();
+        buildGraph(root, graph);
+        return graph;
+    }
+
+    private void buildGraph(TreeNode node, HashMap<Integer, List<Integer>> graph) {
+        if (node == null) {
+            return;
+        }
+
+        graph.putIfAbsent(node.val, new ArrayList<>());
+
+        if (node.left != null) {
+            graph.get(node.val).add(node.left.val);
+            graph.putIfAbsent(node.left.val, new ArrayList<>());
+            graph.get(node.left.val).add(node.val);
+            buildGraph(node.left, graph);
+        }
+
+        if (node.right != null) {
+            graph.get(node.val).add(node.right.val);
+            graph.putIfAbsent(node.right.val, new ArrayList<>());
+            graph.get(node.right.val).add(node.val);
+            buildGraph(node.right, graph);
+        }
+    }
+}
diff --git a/kotlin/0872-leaf-similar-trees.kt b/kotlin/0872-leaf-similar-trees.kt
@@ -0,0 +1,22 @@
+class Solution {
+    fun leafSimilar(root1: TreeNode?, root2: TreeNode?): Boolean {
+
+        fun dfs(root: TreeNode?, res: MutableList<Int>) {
+            root?: return
+
+            if (root.left == null && root.right == null)
+                res.add(root.`val`)
+            
+            dfs(root.left, res)
+            dfs(root.right, res)
+        }
+
+        val res1: MutableList<Int> = mutableListOf()
+        val res2: MutableList<Int> = mutableListOf()
+        
+        dfs(root1, res1)
+        dfs(root2, res2)
+
+        return res1 == res2
+    }
+}
