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/ruby/chapter_dynamic_programming/coin_change.rb

@@ -0,0 +1,65 @@
+=begin
+File: coin_change.rb
+Created Time: 2024-05-29
+Author: Xuan Khoa Tu Nguyen (ngxktuzkai2000@gmail.com)
+=end
+
+### Coin change: dynamic programming ###
+def coin_change_dp(coins, amt)
+  n = coins.length
+  _MAX = amt + 1
+  # Initialize dp table
+  dp = Array.new(n + 1) { Array.new(amt + 1, 0) }
+  # State transition: first row and first column
+  (1...(amt + 1)).each { |a| dp[0][a] = _MAX }
+  # State transition: rest of the rows and columns
+  for i in 1...(n + 1)
+    for a in 1...(amt + 1)
+      if coins[i - 1] > a
+        # If exceeds target amount, don't select coin i
+        dp[i][a] = dp[i - 1][a]
+      else
+        # The smaller value between not selecting and selecting coin i
+        dp[i][a] = [dp[i - 1][a], dp[i][a - coins[i - 1]] + 1].min
+      end
+    end
+  end
+  dp[n][amt] != _MAX ? dp[n][amt] : -1
+end
+
+### Coin change: space-optimized DP ###
+def coin_change_dp_comp(coins, amt)
+  n = coins.length
+  _MAX = amt + 1
+  # Initialize dp table
+  dp = Array.new(amt + 1, _MAX)
+  dp[0] = 0
+  # State transition
+  for i in 1...(n + 1)
+    # Traverse in forward order
+    for a in 1...(amt + 1)
+      if coins[i - 1] > a
+        # If exceeds target amount, don't select coin i
+        dp[a] = dp[a]
+      else
+        # The smaller value between not selecting and selecting coin i
+        dp[a] = [dp[a], dp[a - coins[i - 1]] + 1].min
+      end
+    end
+  end
+  dp[amt] != _MAX ? dp[amt] : -1
+end
+
+### Driver Code ###
+if __FILE__ == $0
+  coins = [1, 2, 5]
+  amt = 4
+
+  # Dynamic programming
+  res = coin_change_dp(coins, amt)
+  puts "Minimum coins needed to make target amount is #{res}"
+
+  # Space-optimized dynamic programming
+  res = coin_change_dp_comp(coins, amt)
+  puts "Minimum coins needed to make target amount is #{res}"
+end