Improved dart tasks

Author: javadev

src/main/dart/g0001_0100/s0003_longest_substring_without_repeating_characters/readme.md

@@ -53,7 +53,8 @@ class Solution {
     int start = 0;
 
     for (int i = 0; i < s.length; i++) {
-      int cur = s.codeUnitAt(i); // Getting ASCII value of the character
+      // Getting ASCII value of the character
+      int cur = s.codeUnitAt(i);
       if (lastIndices[cur] < start) {
         lastIndices[cur] = i;
         curLen++;

src/main/dart/g0001_0100/s0004_median_of_two_sorted_arrays/readme.md

@@ -68,8 +68,10 @@ class Solution {
     int low = 0;
     int high = n1;
 
-    int minValue = -pow(2, 31).toInt(); // substitute for Integer.MIN_VALUE
-    int maxValue = pow(2, 31).toInt() - 1; // substitute for Integer.MAX_VALUE
+    // substitute for Integer.MIN_VALUE
+    int minValue = -pow(2, 31).toInt();
+    // substitute for Integer.MAX_VALUE
+    int maxValue = pow(2, 31).toInt() - 1;
 
     while (low <= high) {
       int cut1 = (low + high) ~/ 2;

src/main/dart/g0001_0100/s0008_string_to_integer_atoi/readme.md

@@ -149,16 +149,14 @@ class Solution {
     // read digits
     while (current < s.length && digits.containsKey(s[current])) {
       int digit = digits[s[current++]]!;
-      // check owerflow
+      // check overflow
       if (sign == -1 && res < (MIN + digit) / 10) {
         return MIN;
       } else if (res > (MAX - digit) / 10) {
         return MAX;
       }
-
       res = res * 10 + sign * digit;
     }
-
     return res;
   }
 }

src/main/dart/g0001_0100/s0011_container_with_most_water/readme.md

@@ -46,6 +46,8 @@ Given `n` non-negative integers <code>a<sub>1</sub>, a<sub>2</sub>, ..., a<sub>n
 ## Solution
 
 ```dart
+import 'dart:math';
+
 class Solution {
   int maxArea(List<int> height) {
     int maxArea = -1;
@@ -64,9 +66,5 @@ class Solution {
 
     return maxArea;
   }
-
-  int max(int a, int b) {
-    return (a > b) ? a : b;
-  }
 }
 ```

src/main/dart/g0001_0100/s0045_jump_game_ii/readme.md

@@ -35,6 +35,8 @@ You can assume that you can always reach the last index.
 ## Solution
 
 ```dart
+import 'dart:math';
+
 class Solution {
   int jump(List<int> nums) {
     int length = 0;
@@ -58,10 +60,5 @@ class Solution {
 
     return minJump;
   }
-
-  // Dart's equivalent for Java's Math.max() is the built-in max() function
-  int max(int a, int b) {
-    return a > b ? a : b;
-  }
 }
 ```

src/main/dart/g0101_0200/s0121_best_time_to_buy_and_sell_stock/readme.md

@@ -37,6 +37,8 @@ Note that buying on day 2 and selling on day 1 is not allowed because you must b
 ## Solution
 
 ```dart
+import 'dart:math';
+
 class Solution {
   int maxProfit(List<int> prices) {
     int maxProfit = 0;
@@ -52,7 +54,5 @@ class Solution {
 
     return maxProfit;
   }
-
-  int max(int a, int b) => a > b ? a : b; // Utility function for max
 }
 ```

src/main/dart/g0101_0200/s0124_binary_tree_maximum_path_sum/readme.md

@@ -49,7 +49,7 @@ Given the `root` of a binary tree, return _the maximum **path sum** of any **non
  * }
  */
 class Solution {
-  int _max = -999999999; // Use a large negative value instead of -double.infinity.toInt()
+  int _max = -999999999;
 
   int _helper(TreeNode? root) {
     if (root == null) {