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_dynamic_programming/coin_change_ii.go

@@ -0,0 +1,54 @@
+// File: coin_change_ii.go
+// Created Time: 2023-07-23
+// Author: Reanon (793584285@qq.com)
+
+package chapter_dynamic_programming
+
+/* Coin change II: Dynamic programming */
+func coinChangeIIDP(coins []int, amt int) int {
+	n := len(coins)
+	// Initialize dp table
+	dp := make([][]int, n+1)
+	for i := 0; i <= n; i++ {
+		dp[i] = make([]int, amt+1)
+	}
+	// Initialize first column
+	for i := 0; i <= n; i++ {
+		dp[i][0] = 1
+	}
+	// State transition: rest of the rows and columns
+	for i := 1; i <= n; i++ {
+		for a := 1; a <= amt; a++ {
+			if coins[i-1] > a {
+				// If exceeds target amount, don't select coin i
+				dp[i][a] = dp[i-1][a]
+			} else {
+				// Sum of the two options: not selecting and selecting coin i
+				dp[i][a] = dp[i-1][a] + dp[i][a-coins[i-1]]
+			}
+		}
+	}
+	return dp[n][amt]
+}
+
+/* Coin change II: Space-optimized dynamic programming */
+func coinChangeIIDPComp(coins []int, amt int) int {
+	n := len(coins)
+	// Initialize dp table
+	dp := make([]int, amt+1)
+	dp[0] = 1
+	// State transition
+	for i := 1; i <= n; i++ {
+		// Traverse in forward order
+		for a := 1; a <= amt; a++ {
+			if coins[i-1] > a {
+				// If exceeds target amount, don't select coin i
+				dp[a] = dp[a]
+			} else {
+				// Sum of the two options: not selecting and selecting coin i
+				dp[a] = dp[a] + dp[a-coins[i-1]]
+			}
+		}
+	}
+	return dp[amt]
+}