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/kotlin/chapter_divide_and_conquer/binary_search_recur.kt

@@ -0,0 +1,49 @@
+/**
+ * File: binary_search_recur.kt
+ * Created Time: 2024-01-25
+ * Author: curtishd (1023632660@qq.com)
+ */
+
+package chapter_divide_and_conquer.binary_search_recur
+
+/* Binary search: problem f(i, j) */
+fun dfs(
+    nums: IntArray,
+    target: Int,
+    i: Int,
+    j: Int
+): Int {
+    // If the interval is empty, it means there is no target element, return -1
+    if (i > j) {
+        return -1
+    }
+    // Calculate the midpoint index m
+    val m = (i + j) / 2
+    return if (nums[m] < target) {
+        // Recursion subproblem f(m+1, j)
+        dfs(nums, target, m + 1, j)
+    } else if (nums[m] > target) {
+        // Recursion subproblem f(i, m-1)
+        dfs(nums, target, i, m - 1)
+    } else {
+        // Found the target element, return its index
+        m
+    }
+}
+
+/* Binary search */
+fun binarySearch(nums: IntArray, target: Int): Int {
+    val n = nums.size
+    // Solve the problem f(0, n-1)
+    return dfs(nums, target, 0, n - 1)
+}
+
+/* Driver Code */
+fun main() {
+    val target = 6
+    val nums = intArrayOf(1, 3, 6, 8, 12, 15, 23, 26, 31, 35)
+
+    // Binary search (closed interval on both sides)
+    val index = binarySearch(nums, target)
+    println("Index of target element 6 = $index")
+}

en/codes/kotlin/chapter_divide_and_conquer/build_tree.kt

@@ -0,0 +1,55 @@
+/**
+ * File: build_tree.kt
+ * Created Time: 2024-01-25
+ * Author: curtishd (1023632660@qq.com)
+ */
+
+package chapter_divide_and_conquer.build_tree
+
+import utils.TreeNode
+import utils.printTree
+
+/* Build binary tree: divide and conquer */
+fun dfs(
+    preorder: IntArray,
+    inorderMap: Map<Int?, Int?>,
+    i: Int,
+    l: Int,
+    r: Int
+): TreeNode? {
+    // Terminate when the subtree interval is empty
+    if (r - l < 0) return null
+    // Initialize the root node
+    val root = TreeNode(preorder[i])
+    // Query m to divide the left and right subtrees
+    val m = inorderMap[preorder[i]]!!
+    // Subproblem: build the left subtree
+    root.left = dfs(preorder, inorderMap, i + 1, l, m - 1)
+    // Subproblem: build the right subtree
+    root.right = dfs(preorder, inorderMap, i + 1 + m - l, m + 1, r)
+    // Return the root node
+    return root
+}
+
+/* Build binary tree */
+fun buildTree(preorder: IntArray, inorder: IntArray): TreeNode? {
+    // Initialize hash map, storing the mapping from inorder elements to indices
+    val inorderMap = HashMap<Int?, Int?>()
+    for (i in inorder.indices) {
+        inorderMap[inorder[i]] = i
+    }
+    val root = dfs(preorder, inorderMap, 0, 0, inorder.size - 1)
+    return root
+}
+
+/* Driver Code */
+fun main() {
+    val preorder = intArrayOf(3, 9, 2, 1, 7)
+    val inorder = intArrayOf(9, 3, 1, 2, 7)
+    println("Pre-order traversal = ${preorder.contentToString()}")
+    println("In-order traversal = ${inorder.contentToString()}")
+
+    val root = buildTree(preorder, inorder)
+    println("The constructed binary tree is:")
+    printTree(root)
+}

en/codes/kotlin/chapter_divide_and_conquer/hanota.kt

@@ -0,0 +1,56 @@
+/**
+ * File: hanota.kt
+ * Created Time: 2024-01-25
+ * Author: curtishd (1023632660@qq.com)
+ */
+
+package chapter_divide_and_conquer.hanota
+
+/* Move a disk */
+fun move(src: MutableList<Int>, tar: MutableList<Int>) {
+    // Take out a disk from the top of src
+    val pan = src.removeAt(src.size - 1)
+    // Place the disk on top of tar
+    tar.add(pan)
+}
+
+/* Solve the Tower of Hanoi problem f(i) */
+fun dfs(i: Int, src: MutableList<Int>, buf: MutableList<Int>, tar: MutableList<Int>) {
+    // If there is only one disk left in src, move it directly to tar
+    if (i == 1) {
+        move(src, tar)
+        return
+    }
+    // Subproblem f(i-1): move the top i-1 disks from src to buf using tar
+    dfs(i - 1, src, tar, buf)
+    // Subproblem f(1): move the remaining disk from src to tar
+    move(src, tar)
+    // Subproblem f(i-1): move the top i-1 disks from buf to tar using src
+    dfs(i - 1, buf, src, tar)
+}
+
+/* Solve the Tower of Hanoi problem */
+fun solveHanota(A: MutableList<Int>, B: MutableList<Int>, C: MutableList<Int>) {
+    val n = A.size
+    // Move the top n disks from A to C using B
+    dfs(n, A, B, C)
+}
+
+/* Driver Code */
+fun main() {
+    // The tail of the list is the top of the rod
+    val A = mutableListOf(5, 4, 3, 2, 1)
+    val B = mutableListOf<Int>()
+    val C = mutableListOf<Int>()
+    println("In initial state:")
+    println("A = $A")
+    println("B = $B")
+    println("C = $C")
+
+    solveHanota(A, B, C)
+
+    println("After disk movement is complete:")
+    println("A = $A")
+    println("B = $B")
+    println("C = $C")
+}