SavioCarvalhoMoraes/challenge-algorithms-v2.0-Savio-Carvalho-Moraes
1
0
Fork 0
forked from M3-Academy/challenge-algorithms-v2.0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Merge pull request 'feat(mostRepeatedChar): Adicionando algoritmo que retorna a letra mais repetida de uma string.' (#9) from feature/mostRepeatedChar into development

Browse Source 
Reviewed-on: #9
This commit is contained in:
Savio Carvalho Moraes 2022-10-30 18:22:48 +00:00
commit e5a5b59d9e
2 changed files with 32 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
08-isAnagram/readme.md
View File

@ -1,13 +1,11 @@
# Desafio 08: Anagrama # Desafio 08: Anagrama
Faça um algoritmo que retorne se um palavra é anagram da outra Faça um algoritmo que retorne se um palavra é anagram da outra
## Exemplo ## Exemplo
```js ```js
isAnagram("roma", "amor"); // true
isAnagram('roma', 'amor') // true isAnagram("roma", "amora"); // false
isAnagram('roma', 'amora') // false isAnagram("roma", "amora"); // false
isAnagram('roma', 'amora') // false ```
```

30
09-mostRepeatedChar/index.js
View File

@ -1,4 +1,28 @@
export function mostUsedChar(text) { export function mostUsedChar(text) {
// implementar logica aqui let vetChar = [];
return "" let qtdCharAtual = 0;
} let charAtual = "";
let qtdCharMaior = 0;
let charMaior = "";
for (let index = 0; index < text.length; index++) {
const element = text[index];
if (!vetChar.includes(element)) {
vetChar.push(element);
}
}
for (let chave = 0; chave <= vetChar.length; chave++) {
charAtual = vetChar[chave];
qtdCharAtual = 0;
for (let index = 0; index <= text.length; index++) {
if (vetChar[chave] === text[index]) {
qtdCharAtual = qtdCharAtual + 1;
}
if (qtdCharMaior < qtdCharAtual && vetChar[chave] !== text[index]) {
charMaior = charAtual;
qtdCharMaior = qtdCharAtual;
}
}
}
return charMaior;
}