chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-244-sliders.md

@@ -1,32 +1,34 @@
 ---
 id: 5900f4601000cf542c50ff72
-title: 问题244：滑块
+title: 'Problem 244: Sliders'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 301891
 dashedName: problem-244-sliders
 ---
 
 # --description--
 
-你可能知道游戏Fifteen Puzzle。在这里，我们有7个红色瓷砖和8个蓝色瓷砖，而不是编号瓷砖。移动由方块（左，右，上，下）的大写初始值表示，其中区块滑动，例如从配置（S）开始，通过序列LULUR我们到达配置（E）：
+You probably know the game Fifteen Puzzle. Here, instead of numbered tiles, we have seven red tiles and eight blue tiles.
 
-（S），（E）
+A move is denoted by the uppercase initial of the direction (Left, Right, Up, Down) in which the tile is slid, e.g. starting from configuration (S), by the sequence LULUR we reach the configuration (E):
 
-对于每个路径，其校验和由（伪代码）计算：
+(S), (E)
 
-checksum = 0 checksum =（checksum×243 + m1）mod 100 000 007 checksum =（checksum×243 + m2）mod 100 000 007 ... checksum =（checksum×243 + mn）mod 100 000 007其中mk是ASCII值移动序列中的第k个字母和移动的ASCII值为：
+For each path, its checksum is calculated by (pseudocode):
+
+checksum = 0 checksum = (checksum × 243 + m1) mod 100 000 007 checksum = (checksum × 243 + m2) mod 100 000 007 … checksum = (checksum × 243 + mn) mod 100 000 007 where mk is the ASCII value of the kth letter in the move sequence and the ASCII values for the moves are:
 
 L76R82U85D68
 
-对于上面给出的序列LULUR，校验和将是19761398.现在，从配置（S）开始，找到达到配置（T）的所有最短路径。
+For the sequence LULUR given above, the checksum would be 19761398. Now, starting from configuration (S), find all shortest ways to reach configuration (T).
 
-（S），（T）
+(S), (T)
 
-具有最小长度的路径的所有校验和的总和是多少？
+What is the sum of all checksums for the paths having the minimal length?
 
 # --hints--
 
-`euler244()`应该返回96356848。
+`euler244()` should return 96356848.
 
 ```js
 assert.strictEqual(euler244(), 96356848);