chore(i18n,learn): processed translations (#45287)

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

@@ -1,6 +1,6 @@
 ---
 id: 5900f4251000cf542c50ff38
-title: 'Problem 185: Number Mind'
+title: 'Problema 185: Number Mind'
 challengeType: 5
 forumTopicId: 301821
 dashedName: problem-185-number-mind
@@ -8,24 +8,28 @@ dashedName: problem-185-number-mind
 
 # --description--
 
-The game Number Mind is a variant of the well known game Master Mind.
+Il gioco Number Mind è una variante del ben noto gioco Master Mind.
 
-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.
+Invece di chiodini colorati, devi indovinare una sequenza segreta di cifre. Dopo ogni ipotesi ti viene detto solo in quanti posti hai indovinato la cifra corretta. Quindi, se la sequenza era 1234 e avete indovinato 2036, vi sarebbe stato detto che avete una cifra corretta; tuttavia, NON ti sarà detto che hai anche un'altra cifra nel posto sbagliato.
 
-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.
+Per esempio, date le seguenti ipotesi per una sequenza segreta di 5 cifre,
 
-Based on the following guesses,
+$$\begin{align} & 90342 ;2\\;\text{correct}\\\\ & 70794 ;0\\;\text{correct}\\\\ & 39458 ;2\\;\text{correct}\\\\ & 34109 ;1\\;\text{correct}\\\\ & 51545 ;2\\;\text{correct}\\\\ & 12531 ;1\\;\text{correct} \end{align}$$
 
-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
+La sequenza corretta 39542 è unica.
 
-Find the unique 16-digit secret sequence.
+Sulla base delle ipotesi seguenti,
+
+$$\begin{align} & 5616185650518293 ;2\\;\text{correct}\\\\ & 3847439647293047 ;1\\;\text{correct}\\\\ & 5855462940810587 ;3\\;\text{correct}\\\\ & 9742855507068353 ;3\\;\text{correct}\\\\ & 4296849643607543 ;3\\;\text{correct}\\\\ & 3174248439465858 ;1\\;\text{correct}\\\\ & 4513559094146117 ;2\\;\text{correct}\\\\ & 7890971548908067 ;3\\;\text{correct}\\\\ & 8157356344118483 ;1\\;\text{correct}\\\\ & 2615250744386899 ;2\\;\text{correct}\\\\ & 8690095851526254 ;3\\;\text{correct}\\\\ & 6375711915077050 ;1\\;\text{correct}\\\\ & 6913859173121360 ;1\\;\text{correct}\\\\ & 6442889055042768 ;2\\;\text{correct}\\\\ & 2321386104303845 ;0\\;\text{correct}\\\\ & 2326509471271448 ;2\\;\text{correct}\\\\ & 5251583379644322 ;2\\;\text{correct}\\\\ & 1748270476758276 ;3\\;\text{correct}\\\\ & 4895722652190306 ;1\\;\text{correct}\\\\ & 3041631117224635 ;3\\;\text{correct}\\\\ & 1841236454324589 ;3\\;\text{correct}\\\\ & 2659862637316867 ;2\\;\text{correct} \end{align}$$
+
+Trova la sequenza segreta unica a 16 cifre.
 
 # --hints--
 
-`euler185()` should return 4640261571849533.
+`numberMind()` dovrebbe restituire `4640261571849533`.
 
 ```js
-assert.strictEqual(euler185(), 4640261571849533);
+assert.strictEqual(numberMind(), 4640261571849533);
 ```
 
 # --seed--
@@ -33,12 +37,12 @@ assert.strictEqual(euler185(), 4640261571849533);
 ## --seed-contents--
 
 ```js
-function euler185() {
+function numberMind() {
 
   return true;
 }
 
-euler185();
+numberMind();
 ```
 
 # --solutions--