forked from M3-Academy/challenge-algorithms-v2.0
Merge pull request 'development/desafio-02' (#11) from development/desafio-02 into master
Reviewed-on: EmmanuelVitor/challenge-algorithms-v2.0-EmmanuelVitor#11
This commit is contained in:
commit
b92c7847d3
@ -1,4 +1,4 @@
|
||||
export function greet(name) {
|
||||
// implementar logica aqui
|
||||
return "";
|
||||
return `Hello ${name}`;
|
||||
}
|
||||
|
@ -1,3 +1,4 @@
|
||||
export function triangleArea(base, height) {
|
||||
// your code here
|
||||
return ((base * height) / 2);
|
||||
}
|
@ -1,4 +1,5 @@
|
||||
export function maxValue(values) {
|
||||
// implementar logica aqui
|
||||
return (values.length == 0) ? 0 : Math.max(...values);
|
||||
|
||||
}
|
@ -1,4 +1,11 @@
|
||||
export function fibonacci(value) {
|
||||
// implementar logica aqui
|
||||
|
||||
let term = 0, actual = 1, next;
|
||||
for (let i = 1; i <= value; i++) {
|
||||
next = term + actual;
|
||||
term = actual;
|
||||
actual = next;
|
||||
}
|
||||
return term
|
||||
}
|
@ -1,4 +1,11 @@
|
||||
export function isPrime(value) {
|
||||
// implementar logica aqui
|
||||
|
||||
let numberOfDivisors = 0
|
||||
for (let i = 1; i <= value; i++) {
|
||||
if ((value % i) === 0) {
|
||||
numberOfDivisors++;
|
||||
}
|
||||
}
|
||||
return (numberOfDivisors === 2) ? true : false
|
||||
}
|
@ -1,4 +1,9 @@
|
||||
export function sum(values) {
|
||||
// implementar logica aqui
|
||||
|
||||
let resultSum = 0;
|
||||
values.forEach(element => {
|
||||
resultSum += element;
|
||||
});
|
||||
return resultSum
|
||||
}
|
@ -1,4 +1,11 @@
|
||||
export function sumEven(value) {
|
||||
// implementar logica aqui
|
||||
|
||||
let resultEvenSum = 0;
|
||||
value.forEach(element => {
|
||||
if ((element % 2) === 0) {
|
||||
resultEvenSum += element;
|
||||
}
|
||||
});
|
||||
|
||||
return resultEvenSum;
|
||||
}
|
@ -1,4 +1,8 @@
|
||||
export function isAnagram(word1, word2) {
|
||||
// implementar logica aqui
|
||||
|
||||
let newWord = word1.toLowerCase().split("").sort().join();
|
||||
let newWord2 = word2.toLowerCase().split("").sort().join();
|
||||
|
||||
return (newWord === newWord2) ? true : false;
|
||||
}
|
@ -1,4 +1,17 @@
|
||||
export function mostUsedChar(text) {
|
||||
// implementar logica aqui
|
||||
return ""
|
||||
let char = '';
|
||||
let repeatLetter = 0;
|
||||
for (const character of text) {
|
||||
let countLetter = 0;
|
||||
for (const verifyCharacter of text) {
|
||||
if (character === verifyCharacter)
|
||||
countLetter++
|
||||
}
|
||||
if (countLetter > repeatLetter) {
|
||||
repeatLetter = countLetter;
|
||||
char = character
|
||||
}
|
||||
}
|
||||
return char;
|
||||
}
|
@ -1,4 +1,15 @@
|
||||
export function longestWords(words) {
|
||||
// implementar logica aqui
|
||||
|
||||
let longWords = [];
|
||||
for (let i = 0; i < words.length; i++) {
|
||||
if ((longWords.length === 0) || (words[i].length === longWords[0].length)) {
|
||||
longWords.push(words[i]);
|
||||
|
||||
} else if (words[i].length > longWords[0].length) {
|
||||
longWords = [];
|
||||
longWords.push(words[i]);
|
||||
}
|
||||
}
|
||||
return longWords;
|
||||
}
|
Loading…
Reference in New Issue
Block a user