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/cpp/utils/list_node.hpp

@@ -30,7 +30,7 @@ ListNode *vecToLinkedList(vector<int> list) {
     return dum->next;
 }
 
-/* Free memory allocated to the linked list */
+/* Free memory allocated to linked list */
 void freeMemoryLinkedList(ListNode *cur) {
     // Free memory
     ListNode *pre;

en/codes/cpp/utils/print_utils.hpp

@@ -199,7 +199,7 @@ template <typename T> void printDeque(deque<T> deque) {
 }
 
 /* Print hash table */
-// Define template parameters TKey and TValue to specify the types of key-value pairs
+// Define template parameters TKey and TValue to specify key-value pair types
 template <typename TKey, typename TValue> void printHashMap(unordered_map<TKey, TValue> map) {
     for (auto kv : map) {
         cout << kv.first << " -> " << kv.second << '\n';
@@ -216,12 +216,12 @@ template <typename T, typename S, typename C> S &Container(priority_queue<T, S,
     return HackedQueue::Container(pq);
 }
 
-/* Print heap (Priority queue) */
+/* Print heap (priority queue) */
 template <typename T, typename S, typename C> void printHeap(priority_queue<T, S, C> &heap) {
     vector<T> vec = Container(heap);
-    cout << "Array representation of the heap:";
+    cout << "Heap array representation:";
     printVector(vec);
-    cout << "Tree representation of the heap:" << endl;
+    cout << "Heap tree representation:" << endl;
     TreeNode *root = vectorToTree(vec);
     printTree(root);
     freeMemoryTree(root);

en/codes/cpp/utils/tree_node.hpp

@@ -23,11 +23,11 @@ struct TreeNode {
     }
 };
 
-// For serialization encoding rules, refer to:
+// For the serialization encoding rules, please refer to:
 // https://www.hello-algo.com/chapter_tree/array_representation_of_tree/
-// Array representation of the binary tree:
+// Array representation of binary tree:
 // [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15]
-// Linked list representation of the binary tree:
+// Linked list representation of binary tree:
 //             /——— 15
 //         /——— 7
 //     /——— 3
@@ -39,7 +39,7 @@ struct TreeNode {
 //         \——— 4
 //             \——— 8
 
-/* Deserialize a list into a binary tree: Recursively */
+/* Deserialize a list into a binary tree: recursion */
 TreeNode *vectorToTreeDFS(vector<int> &arr, int i) {
     if (i < 0 || i >= arr.size() || arr[i] == INT_MAX) {
         return nullptr;
@@ -55,7 +55,7 @@ TreeNode *vectorToTree(vector<int> arr) {
     return vectorToTreeDFS(arr, 0);
 }
 
-/* Serialize a binary tree into a list: Recursively */
+/* Serialize a binary tree into a list: recursion */
 void treeToVecorDFS(TreeNode *root, int i, vector<int> &res) {
     if (root == nullptr)
         return;
@@ -74,7 +74,7 @@ vector<int> treeToVecor(TreeNode *root) {
     return res;
 }
 
-/* Free memory allocated to the binary tree */
+/* Free binary tree memory */
 void freeMemoryTree(TreeNode *root) {
     if (root == nullptr)
         return;

en/codes/cpp/utils/vertex.hpp

@@ -17,7 +17,7 @@ struct Vertex {
     }
 };
 
-/* Input a list of values vals, return a list of vertices vets */
+/* Input value list vals, return vertex list vets */
 vector<Vertex *> valsToVets(vector<int> vals) {
     vector<Vertex *> vets;
     for (int val : vals) {
@@ -26,7 +26,7 @@ vector<Vertex *> valsToVets(vector<int> vals) {
     return vets;
 }
 
-/* Input a list of vertices vets, return a list of values vals */
+/* Input vertex list vets, return value list vals */
 vector<int> vetsToVals(vector<Vertex *> vets) {
     vector<int> vals;
     for (Vertex *vet : vets) {