gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

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

Browse Source
This commit is contained in:
camperbot
2021-09-06 03:52:36 -07:00
committed by GitHub
parent b952bbb179
commit 148cf18412
70 changed files with 650 additions and 660 deletions
Download Patch File Download Diff File Expand all files Collapse all files

30
curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/last-letter-first-letter.md
View File

@@ -1,6 +1,6 @@
---
id: 5e4ce2b6ac708cc68c1df25e
title: Last letter-first letter
title: Última letra-primeira letra
challengeType: 5
forumTopicId: 385256
dashedName: last-letter-first-letter
@@ -8,30 +8,30 @@ dashedName: last-letter-first-letter
# --description--
A certain children's game involves starting with a word in a particular category. Each participant in turn says a word, but that word must begin with the final letter of the previous word. Once a word has been given, it cannot be repeated. If an opponent cannot give a word in the category, they fall out of the game.
Um certo jogo infantil envolve começar com uma palavra em uma determinada categoria. Cada participante, em sua vez, diz uma palavra, mas essa palavra deve começar com a letra final da palavra anterior. Quando uma palavra é dita, ela não pode ser repetida. Se o oponente não disser uma palavra da categoria, ele sai do jogo.
For example, with "animals" as the category,
Por exemplo, com a categoria "animais",
<pre>Child 1: dog
Child 2: goldfish
Child 1: hippopotamus
Child 2: snake
<pre>Criança 1: cachorro
Criança 2: onça
Criança 1: antílope
Criança 2: elefante
...
</pre>
# --instructions--
Write a function that takes an input array of words. The function should return an array of words where the first letter of each word is the same as the last letter of the previous word. Only use the words in the input array, and once a word is used it cannot be repeated. The words in the return array should be selected and sequenced so that that its length is maximized.
Escreva uma função que receba um array de palavras. A função deve retornar um array de palavras em que a primeira letra de cada palavra é a mesma que a última letra da palavra anterior. Use apenas as palavras do array de entrada. Quando uma palavra for usada, ela não poderá ser repetida. As palavras no array de retorno devem ser selecionadas e sequenciadas para que o comprimento do array seja maximizado.
# --hints--
`findLongestChain` should be a function.
`findLongestChain` deve ser uma função.
```js
assert(typeof findLongestChain == 'function');
```
`findLongestChain(["certain", "each", "game", "involves", "starting", "with", "word"])` should return an array.
`findLongestChain(["certain", "each", "game", "involves", "starting", "with", "word"])` deve retornar um array.
```js
assert(
@@ -49,7 +49,7 @@ assert(
);
```
`findLongestChain(["certain", "each", "game", "involves", "starting", "with", "word"])` should return `["involves", "starting", "game", "each"]`.
`findLongestChain(["certain", "each", "game", "involves", "starting", "with", "word"])` deve retornar `["involves", "starting", "game", "each"]`.
```js
assert.deepEqual(
@@ -66,7 +66,7 @@ assert.deepEqual(
);
```
`findLongestChain(["audino", "bagon", "kangaskhan", "banette", "bidoof", "braviary", "exeggcute", "yamask"])` should return `["braviary", "yamask", "kangaskhan"]`
`findLongestChain(["audino", "bagon", "kangaskhan", "banette", "bidoof", "braviary", "exeggcute", "yamask"])` deve retornar `["braviary", "yamask", "kangaskhan"]`
```js
assert.deepEqual(
@@ -84,7 +84,7 @@ assert.deepEqual(
);
```
`findLongestChain(["harp", "poliwrath", "poochyena", "porygon2", "porygonz", "archana"])` should return `["poliwrath", "harp", "poochyena", "archana"]`.
`findLongestChain(["harp", "poliwrath", "poochyena", "porygon2", "porygonz", "archana"])` deve retornar `["poliwrath", "harp", "poochyena", "archana"]`.
```js
assert.deepEqual(
@@ -100,7 +100,7 @@ assert.deepEqual(
);
```
`findLongestChain(["scolipede", "elephant", "zeaking", "sealeo", "silcoon", "tigers"])` should return `["scolipede", "elephant", "tigers", "sealeo"]`.
`findLongestChain(["scolipede", "elephant", "zeaking", "sealeo", "silcoon", "tigers"])` deve retornar `["scolipede", "elephant", "tigers", "sealeo"]`.
```js
assert.deepEqual(
@@ -116,7 +116,7 @@ assert.deepEqual(
);
```
`findLongestChain(["loudred", "lumineon", "lunatone", "machamp", "magnezone", "nosepass", "petilil", "pidgeotto", "pikachu"])` should return `["machamp", "petilil", "lumineon", "nosepass"]`.
`findLongestChain(["loudred", "lumineon", "lunatone", "machamp", "magnezone", "nosepass", "petilil", "pidgeotto", "pikachu"])` deve retornar `["machamp", "petilil", "lumineon", "nosepass"]`.
```js
assert.deepEqual(