chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-41-pandigital-prime.md

@@ -1,24 +1,32 @@
 ---
 id: 5900f3951000cf542c50fea8
-title: 问题41：Pandigital prime
+title: 'Problem 41: Pandigital prime'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 302078
 dashedName: problem-41-pandigital-prime
 ---
 
 # --description--
 
-我们将说*n*数字是pandigital，如果它使用所有数字1到*n*恰好一次。例如，2143是一个4位数的pandigital，也是素数。什么是最大的*n长*数字pandigital素数？
+We shall say that an `n`-digit number is pandigital if it makes use of all the digits 1 to `n` exactly once. For example, 2143 is a 4-digit pandigital and is also prime.
+
+What is the largest `n`-length digit pandigital prime that exists?
 
 # --hints--
 
-`pandigitalPrime(4)`应该返回4231。
+`pandigitalPrime(4)` should return a number.
+
+```js
+assert(typeof pandigitalPrime(4) === 'number');
+```
+
+`pandigitalPrime(4)` should return 4231.
 
 ```js
 assert(pandigitalPrime(4) == 4231);
 ```
 
-`pandigitalPrime(7)`应该返回7652413。
+`pandigitalPrime(7)` should return 7652413.
 
 ```js
 assert(pandigitalPrime(7) == 7652413);