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

curriculum/challenges/chinese-traditional/01-responsive-web-design/basic-html-and-html5/create-a-form-element.md

@@ -13,7 +13,7 @@ dashedName: create-a-form-element
 例如：
 
 ```html
-<form action="/url-where-you-want-to-submit-form-data">
+<form action="url-where-you-want-to-submit-form-data">
   <input>
 </form>
 ```

curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md

@@ -11,6 +11,8 @@ dashedName: stand-in-line
 
 在計算機科學中隊列（<dfn>queue</dfn>）是一個抽象的數據結構（<dfn>Data Structure</dfn>），隊列中的條目都是有秩序的。 新的條目會被加到隊列的末尾，舊的條目會從隊列的頭部被移出。
 
+# --instructions--
+
 寫一個函數 `nextInLine`，用一個數組（`arr`）和一個數字（`item`）作爲參數。
 
 把數字添加到數組的結尾，然後移出數組的第一個元素。

curriculum/challenges/chinese/01-responsive-web-design/basic-html-and-html5/create-a-form-element.md

@@ -13,7 +13,7 @@ dashedName: create-a-form-element
 例如：
 
 ```html
-<form action="/url-where-you-want-to-submit-form-data">
+<form action="url-where-you-want-to-submit-form-data">
   <input>
 </form>
 ```

curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md

@@ -11,6 +11,8 @@ dashedName: stand-in-line
 
 在计算机科学中队列（<dfn>queue</dfn>）是一个抽象的数据结构（<dfn>Data Structure</dfn>），队列中的条目都是有秩序的。 新的条目会被加到队列的末尾，旧的条目会从队列的头部被移出。
 
+# --instructions--
+
 写一个函数 `nextInLine`，用一个数组（`arr`）和一个数字（`item`）作为参数。
 
 把数字添加到数组的结尾，然后移出数组的第一个元素。

curriculum/challenges/espanol/01-responsive-web-design/basic-html-and-html5/create-a-form-element.md

@@ -13,7 +13,7 @@ Puedes construir formularios web que realmente envíen datos a un servidor usand
 Por ejemplo:
 
 ```html
-<form action="/url-where-you-want-to-submit-form-data">
+<form action="url-where-you-want-to-submit-form-data">
   <input>
 </form>
 ```

curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md

@@ -11,6 +11,8 @@ dashedName: stand-in-line
 
 En Informática una <dfn>cola</dfn> (queue) es una estructura de datos <dfn>abstracta</dfn> donde los elementos se mantienen en orden. Los nuevos elementos se pueden añadir en la parte posterior de la cola y los elementos antiguos se retiran de la parte delantera de la cola.
 
+# --instructions--
+
 Escribe una función `nextInLine` que tome un arreglo (`arr`) y un número (`item`) como argumentos.
 
 Agrega el número al final del arreglo, luego elimina el primer elemento del arreglo.

curriculum/challenges/italian/01-responsive-web-design/basic-html-and-html5/create-a-form-element.md

@@ -13,7 +13,7 @@ Puoi creare dei moduli web (form) che inviino effettivamente dei dati a un serve
 Ad esempio:
 
 ```html
-<form action="/url-where-you-want-to-submit-form-data">
+<form action="url-where-you-want-to-submit-form-data">
   <input>
 </form>
 ```

curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md

@@ -11,6 +11,8 @@ dashedName: stand-in-line
 
 In Informatica una <dfn>coda</dfn> (queue) è una <dfn>struttura di dati</dfn> astratta dove gli elementi sono tenuti in ordine. I nuovi elementi possono essere aggiunti alla fine della coda e quelli vecchi vengono rimossi dall'inizio della coda.
 
+# --instructions--
+
 Scrivi una funzione `nextInLine` che prende un array (`arr`) e un numero (`item`) come argomenti.
 
 Aggiungi il numero alla fine dell'array, quindi rimuovi il primo elemento dell'array.

curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.md

@@ -1,6 +1,6 @@
 ---
 id: 5900f5351000cf542c510047
-title: 'Problem 456: Triangles containing the origin II'
+title: 'Problema 456: Triangoli contenenti l''origine II'
 challengeType: 5
 forumTopicId: 302130
 dashedName: problem-456-triangles-containing-the-origin-ii
@@ -8,24 +8,26 @@ dashedName: problem-456-triangles-containing-the-origin-ii
 
 # --description--
 
-Define:xn = (1248n mod 32323) - 16161yn = (8421n mod 30103) - 15051
+Definisci:
 
-Pn = {(x1, y1), (x2, y2), ..., (xn, yn)}
+$$\begin{align} & x_n = ({1248}^n\bmod 32323) - 16161 \\\\ & y_n = ({8421}^n\bmod 30103) - 15051 \\\\ & P_n = \\{(x_1, y_1), (x_2, y_2), \ldots, (x_n, y_n)\\} \end{align}$$
 
-For example, P8 = {(-14913, -6630), (-10161, 5625), (5226, 11896), (8340, -10778), (15852, -5203), (-15165, 11295), (-1427, -14495), (12407, 1060)}.
+Per esempio, $$P_8 = \\{(-14913, -6630), (-10161, 5625), (5226, 11896), (8340, -10778), (15852, -5203), (-15165, 11295), (-1427, -14495), (12407, 1060)\\}$$
 
-Let C(n) be the number of triangles whose vertices are in Pn which contain the origin in the interior.
+Sia $C(n)$ il numero di triangoli i cui vertici sono in $P_n$ che contiene l'origine all'interno.
 
-Examples: C(8) = 20 C(600) = 8950634 C(40 000) = 2666610948988
+Esempi:
 
-Find C(2 000 000).
+$$\begin{align} & C(8) = 20 \\\\ & C(600) = 8\\,950\\,634 \\\\ & C(40\\,000) = 2\\,666\\,610\\,948\\,988 \end{align}$$
+
+Trova $C(2\\,000\\,000)$.
 
 # --hints--
 
-`euler456()` should return 333333208685971500.
+`trianglesContainingOriginTwo()` dovrebbe restituire `333333208685971500`.
 
 ```js
-assert.strictEqual(euler456(), 333333208685971500);
+assert.strictEqual(trianglesContainingOriginTwo(), 333333208685971500);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler456(), 333333208685971500);
 ## --seed-contents--
 
 ```js
-function euler456() {
+function trianglesContainingOriginTwo() {
 
   return true;
 }
 
-euler456();
+trianglesContainingOriginTwo();
 ```
 
 # --solutions--

curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-457-a-polynomial-modulo-the-square-of-a-prime.md

@@ -1,6 +1,6 @@
 ---
 id: 5900f5361000cf542c510048
-title: 'Problem 457: A polynomial modulo the square of a prime'
+title: 'Problema 457: Un polinomiale modulo il quadrato di un primo'
 challengeType: 5
 forumTopicId: 302131
 dashedName: problem-457-a-polynomial-modulo-the-square-of-a-prime
@@ -8,22 +8,22 @@ dashedName: problem-457-a-polynomial-modulo-the-square-of-a-prime
 
 # --description--
 
-Let f(n) = n2 - 3n - 1.
+Sia $f(n) = n^2 - 3n - 1$.
 
-Let p be a prime.
+Sia $p$ un numero primo.
 
-Let R(p) be the smallest positive integer n such that f(n) mod p2 = 0 if such an integer n exists, otherwise R(p) = 0.
+Sia $R(p)$ il più piccolo numero intero positivo $n$ tale che $f(n)\bmod p^2 = 0$ se esiste un numero intero $n$, altrimenti $R(p) = 0$.
 
-Let SR(L) be ∑R(p) for all primes not exceeding L.
+Sia $SR(L)$ pari a $\sum R(p)$ per tutti i primi non superiori a $L$.
 
-Find SR(107).
+Trova $SR({10}^7)$.
 
 # --hints--
 
-`euler457()` should return 2647787126797397000.
+`polynomialModuloSquareOfPrime()` dovrebbe restituire `2647787126797397000`.
 
 ```js
-assert.strictEqual(euler457(), 2647787126797397000);
+assert.strictEqual(polynomialModuloSquareOfPrime(), 2647787126797397000);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler457(), 2647787126797397000);
 ## --seed-contents--
 
 ```js
-function euler457() {
+function polynomialModuloSquareOfPrime() {
 
   return true;
 }
 
-euler457();
+polynomialModuloSquareOfPrime();
 ```
 
 # --solutions--

curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-458-permutations-of-project.md

@@ -1,6 +1,6 @@
 ---
 id: 5900f5361000cf542c510049
-title: 'Problem 458: Permutations of Project'
+title: 'Problema 458: Permutazioni di Project'
 challengeType: 5
 forumTopicId: 302132
 dashedName: problem-458-permutations-of-project
@@ -8,20 +8,20 @@ dashedName: problem-458-permutations-of-project
 
 # --description--
 
-Consider the alphabet A made out of the letters of the word "project": A={c,e,j,o,p,r,t}.
+Considera l' alfabeto $A$ composto dalle lettere della parola `project`: $A = \\{c, e, j, o, p, r, t\\}$.
 
-Let T(n) be the number of strings of length n consisting of letters from A that do not have a substring that is one of the 5040 permutations of "project".
+Sia $T(n)$ il numero di stringhe di lunghezza $n$ formate da lettere di $A$ che non hanno una sottostringa che è una delle 5040 permutazioni di `project`.
 
-T(7)=77-7!=818503.
+$T(7) = 7^7 - 7! = 818\\,503$.
 
-Find T(1012). Give the last 9 digits of your answer.
+Trova $T({10}^{12})$. Dai le ultime 9 cifre della tua risposta.
 
 # --hints--
 
-`euler458()` should return 423341841.
+`permutationsOfProject()` dovrebbe restituire `423341841`.
 
 ```js
-assert.strictEqual(euler458(), 423341841);
+assert.strictEqual(permutationsOfProject(), 423341841);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler458(), 423341841);
 ## --seed-contents--
 
 ```js
-function euler458() {
+function permutationsOfProject() {
 
   return true;
 }
 
-euler458();
+permutationsOfProject();
 ```
 
 # --solutions--

curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-459-flipping-game.md

@@ -1,6 +1,6 @@
 ---
 id: 5900f5371000cf542c51004a
-title: 'Problem 459: Flipping game'
+title: 'Problema 459: gioco flipping'
 challengeType: 5
 forumTopicId: 302133
 dashedName: problem-459-flipping-game
@@ -8,28 +8,38 @@ dashedName: problem-459-flipping-game
 
 # --description--
 
-The flipping game is a two player game played on a N by N square board.
+Il gioco di flipping è un gioco di due giocatori giocato su un tavolo quadrato $N$ per $N$.
 
-Each square contains a disk with one side white and one side black.
+Ogni quadrato contiene un disco con un lato bianco e un lato nero.
 
-The game starts with all disks showing their white side.
+Il gioco inizia con tutti i dischi che mostrano il loro lato bianco.
 
-A turn consists of flipping all disks in a rectangle with the following properties: the upper right corner of the rectangle contains a white disk the rectangle width is a perfect square (1, 4, 9, 16, ...) the rectangle height is a triangular number (1, 3, 6, 10, ...)
+Un turno consiste nel capovolgere tutti i dischi in un rettangolo con le seguenti proprietà:
 
-Players alternate turns. A player wins by turning the grid all black.
+- l'angolo in alto a destra del rettangolo contiene un disco bianco
+- la larghezza del rettangolo è un quadrato perfetto (1, 4, 9, 16, ...)
+- l'altezza del rettangolo è un numero triangolare (1, 3, 6, 10, ...)
 
-Let W(N) be the number of winning moves for the first player on a N by N board with all disks white, assuming perfect play. W(1) = 1, W(2) = 0, W(5) = 8 and W(102) = 31395.
+<img class="img-responsive center-block" alt="capovolgendo tutti i dischi in un rettangolo 4x3 su una tabella 5x5" src="https://cdn.freecodecamp.org/curriculum/project-euler/flipping-game-1.png" style="background-color: white; padding: 10px;" />
 
-For N=5, the first player's eight winning first moves are:
+I giocatori si alternano nei turni. Un giocatore vince girando la griglia in modo che sia tutta nera.
 
-Find W(106).
+Sia $W(N)$ il numero di mosse vincenti per il primo giocatore su una scacchiera $N$ x $N$ con tutti i dischi bianchi, supponendo un gioco perfetto.
+
+$W(1) = 1$, $W(2) = 0$, $W(5) = 8$ and $W({10}^2) = 31\\,395$.
+
+Per $N = 5$, le prime otto mosse vincenti del giocatore sono:
+
+<img class="img-responsive center-block" alt="le otto prime mosse vincenti per N = 5" src="https://cdn.freecodecamp.org/curriculum/project-euler/flipping-game-2.png" style="background-color: white; padding: 10px;" />
+
+Trova $W({10}^6)$.
 
 # --hints--
 
-`euler459()` should return 3996390106631.
+`flippingGame()` dovrebbe restituire `3996390106631`.
 
 ```js
-assert.strictEqual(euler459(), 3996390106631);
+assert.strictEqual(flippingGame(), 3996390106631);
 ```
 
 # --seed--
@@ -37,12 +47,12 @@ assert.strictEqual(euler459(), 3996390106631);
 ## --seed-contents--
 
 ```js
-function euler459() {
+function flippingGame() {
 
   return true;
 }
 
-euler459();
+flippingGame();
 ```
 
 # --solutions--

curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md

@@ -1,6 +1,6 @@
 ---
 id: 5900f5381000cf542c51004b
-title: 'Problem 460: An ant on the move'
+title: 'Problema 460: Una formica in movimento'
 challengeType: 5
 forumTopicId: 302135
 dashedName: problem-460-an-ant-on-the-move
@@ -8,24 +8,33 @@ dashedName: problem-460-an-ant-on-the-move
 
 # --description--
 
-On the Euclidean plane, an ant travels from point A(0, 1) to point B(d, 1) for an integer d.
+Sul piano euclideo, una formica viaggia dal punto $A(0, 1)$ al punto $B(d, 1)$ per un numero intero $d$.
 
-In each step, the ant at point (x0, y0) chooses one of the lattice points (x1, y1) which satisfy x1 ≥ 0 and y1 ≥ 1 and goes straight to (x1, y1) at a constant velocity v. The value of v depends on y0 and y1 as follows: If y0 = y1, the value of v equals y0. If y0 ≠ y1, the value of v equals (y1 - y0) / (ln(y1) - ln(y0)).
+Ad ogni passo, la formica al punto ($x_0$, $y_0$) sceglie uno dei punti sul reticolo ($x_1$, $y_1$) che soddisfano $x_1 ≥ 0$ e $y_1 ≥ 1$ e va dritta a ($x_1$, $y_1$) ad una velocità costante $v$. Il valore di $v$ dipende da $y_0$ e $y_1$ come segue:
 
-The left image is one of the possible paths for d = 4. First the ant goes from A(0, 1) to P1(1, 3) at velocity (3 - 1) / (ln(3) - ln(1)) ≈ 1.8205. Then the required time is sqrt(5) / 1.8205 ≈ 1.2283. From P1(1, 3) to P2(3, 3) the ant travels at velocity 3 so the required time is 2 / 3 ≈ 0.6667. From P2(3, 3) to B(4, 1) the ant travels at velocity (1 - 3) / (ln(1) - ln(3)) ≈ 1.8205 so the required time is sqrt(5) / 1.8205 ≈ 1.2283. Thus the total required time is 1.2283 + 0.6667 + 1.2283 = 3.1233.
+- Se $y_0 = y_1$, il valore di $v$ è uguale a $y_0$.
+- Se $y_0 ≠ y_1$, il valore di $v$ è pari a $\frac{y_1 - y_0}{\ln y_1 - \ln y_0}$.
 
-The right image is another path. The total required time is calculated as 0.98026 + 1 + 0.98026 = 2.96052. It can be shown that this is the quickest path for d = 4.
+L'immagine a sinistra è uno dei percorsi possibili per $d = 4$. Prima la formica va da $A(0, 1)$ a $P_1(1, 3)$ a una velocità $\frac{3 - 1}{\ln 3 - \ln 1} ≈ 1.8205$. Quindi il tempo richiesto è $\frac{\sqrt{5}}{1.820} ≈ 1.2283$.
 
-Let F(d) be the total required time if the ant chooses the quickest path. For example, F(4) ≈ 2.960516287. We can verify that F(10) ≈ 4.668187834 and F(100) ≈ 9.217221972.
+Da $P_1(1, 3)$ a $P_2(3, 3)$ la formica viaggia a velocità 3 quindi il tempo richiesto è $\frac{2}{3} ≈ 0.6667$. Da $P_2(3, 3)$ a $B(4, 1)$ la formica viaggia a velocità $\frac{1 - 3}{\ln 1 - \ln 3} ≈ 1.8205$ quindi il tempo richiesto è $\frac{\sqrt{5}}{1.8205} ≈ 1.2283$.
 
-Find F(10000). Give your answer rounded to nine decimal places.
+Così il tempo totale richiesto è $1.2283 + 0.6667 + 1.2283 = 3.1233$.
+
+L'immagine a destra è un altro percorso. Il tempo totale richiesto è calcolato come $0.98026 + 1 + 0.98026 = 2.96052$. Può essere dimostrato che questo è il percorso più veloce per $d = 4$.
+
+<img class="img-responsive center-block" alt="due possibili percorsi per d = 4" src="https://cdn.freecodecamp.org/curriculum/project-euler/an-ant-on-the-move.jpg" style="background-color: white; padding: 10px;" />
+
+Sia $F(d)$ il tempo totale richiesto se la formica sceglie il percorso più veloce. Ad esempio, $F(4) ≈ 2.960\\,516\\,287$. Siamo in grado di verificare che $F(10) ≈ 4.668\\,187\\,834$ e $F(100) ≈ 9.217\\,221\\,972$.
+
+Trova $F(10\\,000)$. Dai la risposta arrotondata a nove cifre decimali.
 
 # --hints--
 
-`euler460()` should return 18.420738199.
+`antOnTheMove()` dovrebbe restituire `18.420738199`.
 
 ```js
-assert.strictEqual(euler460(), 18.420738199);
+assert.strictEqual(antOnTheMove(), 18.420738199);
 ```
 
 # --seed--
@@ -33,12 +42,12 @@ assert.strictEqual(euler460(), 18.420738199);
 ## --seed-contents--
 
 ```js
-function euler460() {
+function antOnTheMove() {
 
   return true;
 }
 
-euler460();
+antOnTheMove();
 ```
 
 # --solutions--

curriculum/challenges/japanese/00-certifications/relational-database-certification/relational-database-certification.yml

@@ -1,22 +1,22 @@
 ---
 id: 606243f50267e718b1e755f4
-title: Relational Database Certification
+title: リレーショナルデータベース認定証
 certification: relational-database
 challengeType: 7
 isPrivate: true
 tests:
   - 
     id: 5f1a4ef5d5d6b5ab580fc6ae
-    title: Celestial Bodies Database
+    title: 天体データベース
   - 
     id: 5f9771307d4d22b9d2b75a94
-    title: World Cup Database
+    title: ワールドカップデータベース
   - 
     id: 5f87ac112ae598023a42df1a
-    title: Salon Appointment Scheduler
+    title: サロン予約スケジューラー
   - 
     id: 602d9ff222201c65d2a019f2
-    title: Periodic Table Database
+    title: 周期表データベース
   - 
     id: 602da04c22201c65d2a019f4
-    title: Number Guessing Game
+    title: 数当てゲーム

curriculum/challenges/japanese/01-responsive-web-design/basic-html-and-html5/create-a-form-element.md

@@ -13,7 +13,7 @@ dashedName: create-a-form-element
 例:
 
 ```html
-<form action="/url-where-you-want-to-submit-form-data">
+<form action="url-where-you-want-to-submit-form-data">
   <input>
 </form>
 ```

curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md

@@ -11,6 +11,8 @@ dashedName: stand-in-line
 
 コンピューターサイエンスでは、アイテムを順に保存する抽象的な<dfn>データ構造</dfn>として<dfn>キュー</dfn>を使用します。 新しいアイテムはキューの末尾に追加され、古いアイテムはキューの先頭から削除されます。
 
+# --instructions--
+
 配列 (`arr`) と数値 (`item`) を引数として取る関数 `nextInLine` を記述してください。
 
 配列の末尾に数値を追加し、それから配列の先頭の要素を削除してください。

curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/telephone-number-validator.md

@@ -186,7 +186,7 @@ assert(telephoneCheck('(555)5(55?)-5555') === false);
 assert(telephoneCheck('55 55-55-555-5') === false);
 ```
 
-`telephoneCheck("11 555-555-5555")` should return `false`.
+`telephoneCheck("11 555-555-5555")` は `false` を返す必要があります。
 
 ```js
 assert(telephoneCheck('11 555-555-5555') === false);

curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-267-billionaire.md

@@ -1,6 +1,6 @@
 ---
 id: 5900f4771000cf542c50ff8a
-title: 'Problem 267: 億万長者'
+title: '問題 267: 億万長者'
 challengeType: 5
 forumTopicId: 301916
 dashedName: problem-267-billionaire

curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-407-idempotents.md

@@ -1,6 +1,6 @@
 ---
 id: 5900f5041000cf542c510016
-title: '冪等元'
+title: '問題 407: 冪等元'
 challengeType: 5
 forumTopicId: 302075
 dashedName: problem-407-idempotents

curriculum/challenges/japanese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-sentimental-analysis.md

@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d9e
-title: 'RNNを使用した自然言語処理: センチメント分析'
+title: 'RNN を使用した自然言語処理: センチメント分析'
 challengeType: 11
 videoId: lYeLtu8Nq7c
 bilibiliIds:

curriculum/challenges/japanese/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-example.md

@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72da5
-title: 'Q学習による強化学習: 例'
+title: 'Q 学習による強化学習: 例'
 challengeType: 11
 videoId: RBBSNta234s
 bilibiliIds:

curriculum/challenges/japanese/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-part-2.md

@@ -1,6 +1,6 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72da4
-title: 'Q学習による強化学習: パート 2'
+title: 'Q 学習による強化学習: パート 2'
 challengeType: 11
 videoId: DX7hJuaUZ7o
 bilibiliIds:

curriculum/challenges/portuguese/00-certifications/relational-database-certification/relational-database-certification.yml

@@ -1,6 +1,6 @@
 ---
 id: 606243f50267e718b1e755f4
-title: Certificação de banco de dados relacional
+title: Certificação de bancos de dados relacionais
 certification: relational-database
 challengeType: 7
 isPrivate: true

curriculum/challenges/portuguese/01-responsive-web-design/basic-html-and-html5/create-a-form-element.md

@@ -13,7 +13,7 @@ Você pode criar formulários que enviam dados a um servidor usando apenas HTML
 Por exemplo:
 
 ```html
-<form action="/url-where-you-want-to-submit-form-data">
+<form action="url-where-you-want-to-submit-form-data">
   <input>
 </form>
 ```

curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md

@@ -11,6 +11,8 @@ dashedName: stand-in-line
 
 Na Ciência da Computação, uma <dfn>fila</dfn> é uma <dfn>estrutura de dados</dfn> abstrata onde itens são mantidos em ordem. Novos itens podem ser adicionados no final da fila e itens mais antigos são removidos do início da fila.
 
+# --instructions--
+
 Escreva a função `nextInLine`, que recebe um array (`arr`) e um número (`item`) como argumentos.
 
 Adicione o número no final do array e então remova o primeiro elemento do array.

curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/telephone-number-validator.md

@@ -186,6 +186,12 @@ assert(telephoneCheck('(555)5(55?)-5555') === false);
 assert(telephoneCheck('55 55-55-555-5') === false);
 ```
 
+`telephoneCheck("11 555-555-5555")` deve retornar `false`.
+
+```js
+assert(telephoneCheck('11 555-555-5555') === false);
+```
+
 # --seed--
 
 ## --seed-contents--

curriculum/challenges/ukrainian/01-responsive-web-design/basic-html-and-html5/create-a-form-element.md

@@ -13,7 +13,7 @@ dashedName: create-a-form-element
 Наприклад:
 
 ```html
-<form action="/url-where-you-want-to-submit-form-data">
+<form action="url-where-you-want-to-submit-form-data">
   <input>
 </form>
 ```

curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md

@@ -11,6 +11,8 @@ dashedName: stand-in-line
 
 В комп'ютерних науках <dfn>queue</dfn> це абстрактне поняття <dfn>Data Structure</dfn>, де усі елементи зберігають певний порядок. Нові елементи можуть бути додані до черги, а старі елементи - зняті з черги.
 
+# --instructions--
+
 Напишіть функцію `nextInLine`, аргументами якої є масив (`arr`) та число (`item`).
 
 Додайте число до кінця масиву, а тоді видаліть перший елемент з масиву.