Improved tasks 133, 194, 1022, 2366

Author: javadev

src/main/java/g0101_0200/s0133_clone_graph/Solution.java

@@ -1,7 +1,7 @@
 package g0101_0200.s0133_clone_graph;
 
 // #Medium #Hash_Table #Depth_First_Search #Breadth_First_Search #Graph #Udemy_Graph
-// #Top_Interview_150_Graph_General #2022_06_24_Time_45_ms_(29.80%)_Space_42.7_MB_(77.96%)
+// #Top_Interview_150_Graph_General #2025_05_03_Time_25_ms_(68.87%)_Space_43.26_MB_(7.02%)
 
 import com_github_leetcode.Node;
 import java.util.ArrayList;

src/main/java/g0101_0200/s0194_transpose_file/script.sh

@@ -1,8 +1,17 @@
 # Read from the file file.txt and print its transposed content to stdout.
-# #Medium #Shell #2022_06_28_Time_630_ms_(28.43%)_Space_3.9_MB_(71.08%)
-wordcount=$(head -1 file.txt | wc -w)
-col_n=1
-while [[ $col_n -le $wordcount ]]; do
-	awk "{ print \$$col_n }" file.txt | paste -sd " "
-	col_n=$((col_n + 1))
-done
+# #Medium #Shell #2025_05_03_Time_61_ms_(88.19%)_Space_4.14_MB_(38.67%)
+awk '
+{
+    for (i = 1; i <= NF; i++) {
+        if (NR == 1) {
+            a[i] = $i
+        } else {
+            a[i] = a[i] " " $i
+        }
+    }
+}
+END {
+    for (i = 1; i <= NF; i++) {
+        print a[i]
+    }
+}' file.txt

src/main/java/g1001_1100/s1022_sum_of_root_to_leaf_binary_numbers/Solution.java

@@ -1,10 +1,9 @@
 package g1001_1100.s1022_sum_of_root_to_leaf_binary_numbers;
 
-// #Easy #Depth_First_Search #Tree #Binary_Tree #2022_02_26_Time_3_ms_(28.58%)_Space_43.6_MB_(5.47%)
+// #Easy #Depth_First_Search #Tree #Binary_Tree
+// #2025_05_03_Time_0_ms_(100.00%)_Space_42.08_MB_(64.36%)
 
 import com_github_leetcode.TreeNode;
-import java.util.ArrayList;
-import java.util.List;
 
 /*
  * Definition for a binary tree node.
@@ -23,31 +22,17 @@
  */
 public class Solution {
     public int sumRootToLeaf(TreeNode root) {
-        List<List<Integer>> paths = new ArrayList<>();
-        dfs(root, paths, new ArrayList<>());
-        int sum = 0;
-        for (List<Integer> list : paths) {
-            int num = 0;
-            for (int i : list) {
-                num = (num << 1) + i;
-            }
-            sum += num;
-        }
-        return sum;
+        return sumRootToLeaf(root, 0);
     }
 
-    private void dfs(TreeNode root, List<List<Integer>> paths, List<Integer> path) {
-        path.add(root.val);
-        if (root.left != null) {
-            dfs(root.left, paths, path);
-            path.remove(path.size() - 1);
-        }
-        if (root.right != null) {
-            dfs(root.right, paths, path);
-            path.remove(path.size() - 1);
+    private int sumRootToLeaf(TreeNode root, int sum) {
+        if (root == null) {
+            return 0;
         }
+        sum = 2 * sum + root.val;
         if (root.left == null && root.right == null) {
-            paths.add(new ArrayList<>(path));
+            return sum;
         }
+        return sumRootToLeaf(root.left, sum) + sumRootToLeaf(root.right, sum);
     }
 }

src/main/java/g2301_2400/s2366_minimum_replacements_to_sort_the_array/Solution.java

@@ -1,18 +1,19 @@
 package g2301_2400.s2366_minimum_replacements_to_sort_the_array;
 
-// #Hard #Array #Math #Greedy #2022_08_14_Time_10_ms_(28.57%)_Space_81.5_MB_(28.57%)
+// #Hard #Array #Math #Greedy #2025_05_03_Time_3_ms_(98.58%)_Space_56.46_MB_(8.49%)
 
 public class Solution {
     public long minimumReplacement(int[] nums) {
-        int limit = nums[nums.length - 1];
+        int n = nums.length;
+        int prev = nums[n - 1];
         long ans = 0;
-        for (int i = nums.length - 2; i >= 0; i--) {
-            int replacements = nums[i] / limit - 1;
-            if (nums[i] % limit != 0) {
-                replacements++;
+        for (int i = n - 2; i >= 0; i--) {
+            int noOfTime = nums[i] / prev;
+            if (nums[i] % prev != 0) {
+                noOfTime++;
+                prev = nums[i] / noOfTime;
             }
-            ans += replacements;
-            limit = nums[i] / (replacements + 1);
+            ans += noOfTime - 1;
         }
         return ans;
     }