chore(i18n,curriculum): update translations (#44186)

curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-250-250250.md

@@ -1,6 +1,6 @@
 ---
 id: 5900f4661000cf542c50ff78
-title: 'Problem 250: 250250'
+title: 'Problema 250: 250250'
 challengeType: 5
 forumTopicId: 301898
 dashedName: problem-250-250250
@@ -8,14 +8,14 @@ dashedName: problem-250-250250
 
 # --description--
 
-Find the number of non-empty subsets of {11, 22, 33,..., 250250250250}, the sum of whose elements is divisible by 250. Enter the rightmost 16 digits as your answer.
+Encontre o número de subconjuntos não vazios de $\\{11, 22, 33, \ldots, {250250}^{250250}\\}$, cuja soma de elementos é divisível por 250. Insira os 16 algarismos mais à direita para sua resposta.
 
 # --hints--
 
-`euler250()` should return 1425480602091519.
+`twoHundredFifty()` deve retornar `1425480602091519`.
 
 ```js
-assert.strictEqual(euler250(), 1425480602091519);
+assert.strictEqual(twoHundredFifty(), 1425480602091519);
 ```
 
 # --seed--
@@ -23,12 +23,12 @@ assert.strictEqual(euler250(), 1425480602091519);
 ## --seed-contents--
 
 ```js
-function euler250() {
+function twoHundredFifty() {
 
   return true;
 }
 
-euler250();
+twoHundredFifty();
 ```
 
 # --solutions--