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/go/chapter_hashing/array_hash_map.go

@@ -0,0 +1,97 @@
+// File: array_hash_map.go
+// Created Time: 2022-12-14
+// Author: msk397 (machangxinq@gmail.com)
+
+package chapter_hashing
+
+import "fmt"
+
+/* Key-value pair */
+type pair struct {
+	key int
+	val string
+}
+
+/* Hash table based on array implementation */
+type arrayHashMap struct {
+	buckets []*pair
+}
+
+/* Initialize hash table */
+func newArrayHashMap() *arrayHashMap {
+	// Initialize array with 100 buckets
+	buckets := make([]*pair, 100)
+	return &arrayHashMap{buckets: buckets}
+}
+
+/* Hash function */
+func (a *arrayHashMap) hashFunc(key int) int {
+	index := key % 100
+	return index
+}
+
+/* Query operation */
+func (a *arrayHashMap) get(key int) string {
+	index := a.hashFunc(key)
+	pair := a.buckets[index]
+	if pair == nil {
+		return "Not Found"
+	}
+	return pair.val
+}
+
+/* Add operation */
+func (a *arrayHashMap) put(key int, val string) {
+	pair := &pair{key: key, val: val}
+	index := a.hashFunc(key)
+	a.buckets[index] = pair
+}
+
+/* Remove operation */
+func (a *arrayHashMap) remove(key int) {
+	index := a.hashFunc(key)
+	// Set to nil to delete
+	a.buckets[index] = nil
+}
+
+/* Get all key pairs */
+func (a *arrayHashMap) pairSet() []*pair {
+	var pairs []*pair
+	for _, pair := range a.buckets {
+		if pair != nil {
+			pairs = append(pairs, pair)
+		}
+	}
+	return pairs
+}
+
+/* Get all keys */
+func (a *arrayHashMap) keySet() []int {
+	var keys []int
+	for _, pair := range a.buckets {
+		if pair != nil {
+			keys = append(keys, pair.key)
+		}
+	}
+	return keys
+}
+
+/* Get all values */
+func (a *arrayHashMap) valueSet() []string {
+	var values []string
+	for _, pair := range a.buckets {
+		if pair != nil {
+			values = append(values, pair.val)
+		}
+	}
+	return values
+}
+
+/* Print hash table */
+func (a *arrayHashMap) print() {
+	for _, pair := range a.buckets {
+		if pair != nil {
+			fmt.Println(pair.key, "->", pair.val)
+		}
+	}
+}