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/climbing_stairs_backtrack.go

@@ -0,0 +1,36 @@
+// File: climbing_stairs_backtrack.go
+// Created Time: 2023-07-18
+// Author: Reanon (793584285@qq.com)
+
+package chapter_dynamic_programming
+
+/* Backtracking */
+func backtrack(choices []int, state, n int, res []int) {
+	// When climbing to the n-th stair, add 1 to the solution count
+	if state == n {
+		res[0] = res[0] + 1
+	}
+	// Traverse all choices
+	for _, choice := range choices {
+		// Pruning: not allowed to go beyond the n-th stair
+		if state+choice > n {
+			continue
+		}
+		// Attempt: make choice, update state
+		backtrack(choices, state+choice, n, res)
+		// Backtrack
+	}
+}
+
+/* Climbing stairs: Backtracking */
+func climbingStairsBacktrack(n int) int {
+	// Can choose to climb up 1 or 2 stairs
+	choices := []int{1, 2}
+	// Start climbing from the 0-th stair
+	state := 0
+	res := make([]int, 1)
+	// Use res[0] to record the solution count
+	res[0] = 0
+	backtrack(choices, state, n, res)
+	return res[0]
+}