chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-185-number-mind.md

@@ -1,26 +1,28 @@
 ---
 id: 5900f4251000cf542c50ff38
-title: 问题185：数字思维
+title: 'Problem 185: Number Mind'
 challengeType: 5
-videoUrl: ''
+forumTopicId: 301821
 dashedName: problem-185-number-mind
 ---
 
 # --description--
 
-游戏Number Mind是众所周知的游戏Master Mind的变种。而不是彩色钉，你必须猜测一个秘密的数字序列。在每次猜测之后，你只会告诉你猜对了多少个正确的数字。所以，如果序列是1234并且你猜到了2036，那么你会被告知你有一个正确的数字;但是，你不会被告知你在错误的地方也有另一个数字。
+The game Number Mind is a variant of the well known game Master Mind.
 
-例如，给出以下5位秘密序列的猜测，90342; 2正确70794; 0正确39458; 2正确34109; 1正确51545; 2正确12531; 1正确正确序列39542是唯一的。
+Instead of coloured pegs, you have to guess a secret sequence of digits. After each guess you're only told in how many places you've guessed the correct digit. So, if the sequence was 1234 and you guessed 2036, you'd be told that you have one correct digit; however, you would NOT be told that you also have another digit in the wrong place.
 
-基于以下猜测，
+For instance, given the following guesses for a 5-digit secret sequence, 90342 ;2 correct 70794 ;0 correct 39458 ;2 correct 34109 ;1 correct 51545 ;2 correct 12531 ;1 correct The correct sequence 39542 is unique.
 
-5616185650518293 2正确3847439647293047 1正确5855462940810587 3正确9742855507068353 3正确4296849643607543 3正确3174248439465858 1正确4513559094146117 2正确7890971548908067 3正确8157356344118483 1正确2615250744386899 2正确8690095851526254 3正确6375711915077050 1正确6913859173121360; 1更正6442889055042768; 2更正2321386104303845; 0更正2326509471271448; 2更正5251583379644322; 2更正1748270476758276; 3更正4895722652190306; 1更正3041631117224635; 3更正1841236454324589; 3更正2659862637316867; 2更正
+Based on the following guesses,
 
-找到唯一的16位秘密序列。
+5616185650518293 ;2 correct 3847439647293047 ;1 correct 5855462940810587 ;3 correct 9742855507068353 ;3 correct 4296849643607543 ;3 correct 3174248439465858 ;1 correct 4513559094146117 ;2 correct 7890971548908067 ;3 correct 8157356344118483 ;1 correct 2615250744386899 ;2 correct 8690095851526254 ;3 correct 6375711915077050 ;1 correct 6913859173121360 ;1 correct 6442889055042768 ;2 correct 2321386104303845 ;0 correct 2326509471271448 ;2 correct 5251583379644322 ;2 correct 1748270476758276 ;3 correct 4895722652190306 ;1 correct 3041631117224635 ;3 correct 1841236454324589 ;3 correct 2659862637316867 ;2 correct
+
+Find the unique 16-digit secret sequence.
 
 # --hints--
 
-`euler185()`应该返回4640261571849533。
+`euler185()` should return 4640261571849533.
 
 ```js
 assert.strictEqual(euler185(), 4640261571849533);