tiago.trevisani/challenge-algorithms-v2.0-tiago_trevisani
1
0
Fork 0
forked from M3-Academy/challenge-algorithms-v2.0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

fix: ajuste erro de mensagem teste 10

Browse Source
This commit is contained in:
Caroline Moran 2022-10-28 06:17:46 -04:00
parent 49db59181b
commit c6f6df9c59
1 changed files with 41 additions and 22 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

35
10-longestWords/index.test.js
View File

@ -1,12 +1,18 @@
import { longestWords } from '.';
import { longestWords } from ".";
describe('longestWords', () => {
describe("longestWords", () => {
it('Dever retornar ["melancia"] quando passamos a lista ["abacaxi", "melancia", "banana"]', () => {
expect(longestWords(["abacaxi", "melancia", "banana"])).toEqual(["melancia"]);
expect(longestWords(["abacaxi", "melancia", "banana"])).toEqual([
"melancia",
]);
});
it('Dever retornar ["aba", "aa", "ad", "vcd", "aba"] quando passamos a lista ["aba","vcd", "aba"]', () => {
expect(longestWords(["aba", "aa", "ad", "vcd", "aba"])).toEqual(["aba", "vcd", "aba"]);
it('Dever retornar ["aba","vcd", "aba"] quando passamos a lista ["aba", "aa", "ad", "vcd", "aba"]', () => {
expect(longestWords(["aba", "aa", "ad", "vcd", "aba"])).toEqual([
"aba",
"vcd",
"aba",
]);
});
it('Dever retornar ["aa"] quando passamos a lista ["aa"]', () => {
@ -14,7 +20,10 @@ describe('longestWords', () => {
});
it('Dever retornar ["eeee", "abcd"] quando passamos a lista ["abc", "eeee", "abcd", "dcd"]', () => {
expect(longestWords(["abc", "eeee", "abcd", "dcd"])).toEqual(["eeee", "abcd"]);
expect(longestWords(["abc", "eeee", "abcd", "dcd"])).toEqual([
"eeee",
"abcd",
]);
});
it('Dever retornar ["aa", "bb", "cc"] quando passamos a lista ["aa", "bb", "cc"]', () => {
@ -22,7 +31,17 @@ describe('longestWords', () => {
});
it('Dever retornar ["zzzzzz", "abcdef", "aaaaaa"] quando passamos a lista ["a", "abc", "cbd", "zzzzzz", "a", "abcdef", "asasa", "aaaaaa"]', () => {
expect(longestWords(["a", "abc", "cbd", "zzzzzz", "a", "abcdef", "asasa", "aaaaaa"])).toEqual(["zzzzzz", "abcdef", "aaaaaa"]);
expect(
longestWords([
"a",
"abc",
"cbd",
"zzzzzz",
"a",
"abcdef",
"asasa",
"aaaaaa",
])
).toEqual(["zzzzzz", "abcdef", "aaaaaa"]);
});
});