Translate all code to English (#1836)

* Review the EN heading format.

* Fix pythontutor headings.

* Fix pythontutor headings.

* bug fixes

* Fix headings in **/summary.md

* Revisit the CN-to-EN translation for Python code using Claude-4.5

* Revisit the CN-to-EN translation for Java code using Claude-4.5

* Revisit the CN-to-EN translation for Cpp code using Claude-4.5.

* Fix the dictionary.

* Fix cpp code translation for the multipart strings.

* Translate Go code to English.

* Update workflows to test EN code.

* Add EN translation for C.

* Add EN translation for CSharp.

* Add EN translation for Swift.

* Trigger the CI check.

* Revert.

* Update en/hash_map.md

* Add the EN version of Dart code.

* Add the EN version of Kotlin code.

* Add missing code files.

* Add the EN version of JavaScript code.

* Add the EN version of TypeScript code.

* Fix the workflows.

* Add the EN version of Ruby code.

* Add the EN version of Rust code.

* Update the CI check for the English version  code.

* Update Python CI check.

* Fix cmakelists for en/C code.

* Fix Ruby comments

en/codes/dart/chapter_greedy/coin_change_greedy.dart

@@ -0,0 +1,50 @@
+/**
+ * File: coin_change_greedy.dart
+ * Created Time: 2023-08-11
+ * Author: liuyuxin (gvenusleo@gmail.com)
+ */
+
+/* Coin change: Greedy algorithm */
+int coinChangeGreedy(List<int> coins, int amt) {
+  // Assume coins list is sorted
+  int i = coins.length - 1;
+  int count = 0;
+  // Loop to make greedy choices until no remaining amount
+  while (amt > 0) {
+    // Find the coin that is less than and closest to the remaining amount
+    while (i > 0 && coins[i] > amt) {
+      i--;
+    }
+    // Choose coins[i]
+    amt -= coins[i];
+    count++;
+  }
+  // If no feasible solution is found, return -1
+  return amt == 0 ? count : -1;
+}
+
+/* Driver Code */
+void main() {
+  // Greedy algorithm: Can guarantee finding the global optimal solution
+  List<int> coins = [1, 5, 10, 20, 50, 100];
+  int amt = 186;
+  int res = coinChangeGreedy(coins, amt);
+  print("\ncoins = $coins, amt = $amt");
+  print("Minimum coins needed to make $amt is $res");
+
+  // Greedy algorithm: Cannot guarantee finding the global optimal solution
+  coins = [1, 20, 50];
+  amt = 60;
+  res = coinChangeGreedy(coins, amt);
+  print("\ncoins = $coins, amt = $amt");
+  print("Minimum coins needed to make $amt is $res");
+  print("Actually the minimum number needed is 3, i.e., 20 + 20 + 20");
+
+  // Greedy algorithm: Cannot guarantee finding the global optimal solution
+  coins = [1, 49, 50];
+  amt = 98;
+  res = coinChangeGreedy(coins, amt);
+  print("\ncoins = $coins, amt = $amt");
+  print("Minimum coins needed to make $amt is $res");
+  print("Actually the minimum number needed is 2, i.e., 49 + 49");
+}

en/codes/dart/chapter_greedy/fractional_knapsack.dart

@@ -0,0 +1,47 @@
+/**
+ * File: fractional_knapsack.dart
+ * Created Time: 2023-08-11
+ * Author: liuyuxin (gvenusleo@gmail.com)
+ */
+
+/* Item */
+class Item {
+  int w; // Item weight
+  int v; // Item value
+
+  Item(this.w, this.v);
+}
+
+/* Fractional knapsack: Greedy algorithm */
+double fractionalKnapsack(List<int> wgt, List<int> val, int cap) {
+  // Create item list with two attributes: weight, value
+  List<Item> items = List.generate(wgt.length, (i) => Item(wgt[i], val[i]));
+  // Sort by unit value item.v / item.w from high to low
+  items.sort((a, b) => (b.v / b.w).compareTo(a.v / a.w));
+  // Loop for greedy selection
+  double res = 0;
+  for (Item item in items) {
+    if (item.w <= cap) {
+      // If remaining capacity is sufficient, put the entire current item into the knapsack
+      res += item.v;
+      cap -= item.w;
+    } else {
+      // If remaining capacity is insufficient, put part of the current item into the knapsack
+      res += item.v / item.w * cap;
+      // No remaining capacity, so break out of the loop
+      break;
+    }
+  }
+  return res;
+}
+
+/* Driver Code */
+void main() {
+  List<int> wgt = [10, 20, 30, 40, 50];
+  List<int> val = [50, 120, 150, 210, 240];
+  int cap = 50;
+
+  // Greedy algorithm
+  double res = fractionalKnapsack(wgt, val, cap);
+  print("Maximum item value not exceeding knapsack capacity is $res");
+}

en/codes/dart/chapter_greedy/max_capacity.dart

@@ -0,0 +1,37 @@
+/**
+ * File: max_capacity.dart
+ * Created Time: 2023-08-11
+ * Author: liuyuxin (gvenusleo@gmail.com)
+ */
+
+import 'dart:math';
+
+/* Max capacity: Greedy algorithm */
+int maxCapacity(List<int> ht) {
+  // Initialize i, j to be at both ends of the array
+  int i = 0, j = ht.length - 1;
+  // Initial max capacity is 0
+  int res = 0;
+  // Loop for greedy selection until the two boards meet
+  while (i < j) {
+    // Update max capacity
+    int cap = min(ht[i], ht[j]) * (j - i);
+    res = max(res, cap);
+    // Move the shorter board inward
+    if (ht[i] < ht[j]) {
+      i++;
+    } else {
+      j--;
+    }
+  }
+  return res;
+}
+
+/* Driver Code */
+void main() {
+  List<int> ht = [3, 8, 5, 2, 7, 7, 3, 4];
+
+  // Greedy algorithm
+  int res = maxCapacity(ht);
+  print("Maximum capacity is $res");
+}

en/codes/dart/chapter_greedy/max_product_cutting.dart

@@ -0,0 +1,37 @@
+/**
+ * File: max_product_cutting.dart
+ * Created Time: 2023-08-11
+ * Author: liuyuxin (gvenusleo@gmail.com)
+ */
+
+import 'dart:math';
+
+/* Max product cutting: Greedy algorithm */
+int maxProductCutting(int n) {
+  // When n <= 3, must cut out a 1
+  if (n <= 3) {
+    return 1 * (n - 1);
+  }
+  // Greedily cut out 3, a is the number of 3s, b is the remainder
+  int a = n ~/ 3;
+  int b = n % 3;
+  if (b == 1) {
+    // When the remainder is 1, convert a pair of 1 * 3 to 2 * 2
+    return (pow(3, a - 1) * 2 * 2).toInt();
+  }
+  if (b == 2) {
+    // When the remainder is 2, do nothing
+    return (pow(3, a) * 2).toInt();
+  }
+  // When the remainder is 0, do nothing
+  return pow(3, a).toInt();
+}
+
+/* Driver Code */
+void main() {
+  int n = 58;
+
+  // Greedy algorithm
+  int res = maxProductCutting(n);
+  print("Maximum cutting product is $res");
+}