chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-35-circular-primes.md

@@ -1,48 +1,62 @@
 ---
 id: 5900f38f1000cf542c50fea2
-title: 问题35：循环素数
+title: 'Problem 35: Circular primes'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 302009
 dashedName: problem-35-circular-primes
 ---
 
 # --description--
 
-这个数字197被称为循环素数，因为数字的所有旋转：197,971和719本身都是素数。在100：2,3,5,7,11,13,17,31,37,71,73,79和97之下有十三个这样的素数。在n下面有多少个圆形素数，而100 <= n < = 1000000？
+The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.
+
+There are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97.
+
+How many circular primes are there below `n`, whereas 100 ≤ `n` ≤ 1000000?
+
+**Note:**
+
+Circular primes individual rotation can exceed `n`.
 
 # --hints--
 
-`circularPrimes(100)`应该返回13。
+`circularPrimes(100)` should return a number.
+
+```js
+assert(typeof circularPrimes(100) === 'number');
+```
+
+`circularPrimes(100)` should return 13.
 
 ```js
 assert(circularPrimes(100) == 13);
 ```
 
-`circularPrimes(100000)`应该返回43。
+`circularPrimes(100000)` should return 43.
 
 ```js
 assert(circularPrimes(100000) == 43);
 ```
 
-`circularPrimes(250000)`应该返回45。
+`circularPrimes(250000)` should return 45.
 
 ```js
 assert(circularPrimes(250000) == 45);
 ```
 
-`circularPrimes(500000)`应该返回49。
+`circularPrimes(500000)` should return 49.
 
 ```js
 assert(circularPrimes(500000) == 49);
 ```
 
-`circularPrimes(750000)`应该返回49。
+`circularPrimes(750000)` should return 49.
 
 ```js
 assert(circularPrimes(750000) == 49);
 ```
 
-`circularPrimes(1000000)`应该返回55。
+`circularPrimes(1000000)` should return 55.
 
 ```js
 assert(circularPrimes(1000000) == 55);