diff --git a/01-greeting/index.js b/01-greeting/index.js index 8f551af..544b5f1 100644 --- a/01-greeting/index.js +++ b/01-greeting/index.js @@ -1,4 +1,4 @@ export function greet(name) { // implementar logica aqui - return ""; + return `Hello ${name}` } diff --git a/02-triangleArea/index.js b/02-triangleArea/index.js index 7628fcd..319154f 100644 --- a/02-triangleArea/index.js +++ b/02-triangleArea/index.js @@ -1,3 +1,5 @@ -export function triangleArea(base, height) { +export function triangleArea(base, height) { // your code here + let area = base * height / 2 + return area } \ No newline at end of file diff --git a/03-maxValue/index.js b/03-maxValue/index.js index e433b31..b278e4c 100644 --- a/03-maxValue/index.js +++ b/03-maxValue/index.js @@ -1,4 +1,10 @@ export function maxValue(values) { // implementar logica aqui - + if (values.length === 0) { + + return 0; + } + + return Math.max.apply(null,values); + } \ No newline at end of file diff --git a/04-fibonacci/index.js b/04-fibonacci/index.js index 37c64cc..c111ec9 100644 --- a/04-fibonacci/index.js +++ b/04-fibonacci/index.js @@ -1,4 +1,14 @@ export function fibonacci(value) { // implementar logica aqui - + if (value < 1) return 0 + if (value <= 2) return 1 + let fibMinus2 = 0 + let fibMinus1 = 1 + let fibN = value + for (let i = 2; i <=value; i++){ + fibN = fibMinus1 + fibMinus2 + fibMinus2 = fibMinus1 + fibMinus1 = fibN + } + return fibN } \ No newline at end of file diff --git a/05-isPrime/index.js b/05-isPrime/index.js index ec9c4ac..b3b6f2a 100644 --- a/05-isPrime/index.js +++ b/05-isPrime/index.js @@ -1,4 +1,13 @@ export function isPrime(value) { // implementar logica aqui - + if(value == 0 || value == 1) { + return false +} + +for(let div = 2; div <= Math.sqrt(value); div++){ + if(value % div == 0) { + return false + } +} +return true } \ No newline at end of file diff --git a/06-sum/index.js b/06-sum/index.js index ebc2ee1..ebdc89d 100644 --- a/06-sum/index.js +++ b/06-sum/index.js @@ -1,4 +1,13 @@ export function sum(values) { // implementar logica aqui - + if (values.length === 0) { + + return 0; + } + + let sum = values.reduce(function(accumulator,value){ + return accumulator + value; +}) + +return sum } \ No newline at end of file diff --git a/07-sumEven/index.js b/07-sumEven/index.js index bb1e095..8fff8f4 100644 --- a/07-sumEven/index.js +++ b/07-sumEven/index.js @@ -1,4 +1,13 @@ export function sumEven(value) { // implementar logica aqui - -} \ No newline at end of file + const newArray = value; + var i; + let total = 0; + + for (i = 0; i < newArray.length; i++) { + if (newArray[i] % 2 === 0) { + total = total + newArray[i]; + } + } + return total; +} \ No newline at end of file diff --git a/08-isAnagram/index.js b/08-isAnagram/index.js index 918308a..62700e1 100644 --- a/08-isAnagram/index.js +++ b/08-isAnagram/index.js @@ -1,4 +1,6 @@ export function isAnagram(word1, word2) { // implementar logica aqui - -} \ No newline at end of file + word1 = word1.toUpperCase().split('').sort().join(''); + word2 = word2.toUpperCase().split('').sort().join(''); + return word1 === word2 + } \ No newline at end of file diff --git a/09-mostRepeatedChar/index.js b/09-mostRepeatedChar/index.js index b113ed8..e7d6fdf 100644 --- a/09-mostRepeatedChar/index.js +++ b/09-mostRepeatedChar/index.js @@ -1,4 +1,19 @@ export function mostUsedChar(text) { // implementar logica aqui - return "" -} \ No newline at end of file + let result = ''; + let mostUsedCount = 0; + for (const letter of text) { + let countLetter = 0; + for (const letterToCount of text) { + if (letterToCount === letter) { + countLetter++; + } + } + if (countLetter > mostUsedCount) { + mostUsedCount = countLetter; + result = letter; + } + } + + return result; + } \ No newline at end of file diff --git a/10-longestWords/index.js b/10-longestWords/index.js index a98d2d8..d17f723 100644 --- a/10-longestWords/index.js +++ b/10-longestWords/index.js @@ -1,4 +1,14 @@ export function longestWords(words) { // implementar logica aqui - + let newArr = []; + let long = 0; + words.forEach(function(element){ + if(element.length > long){ + long = element.length + } + }); + newArr = words.filter(element => + element.length == long + ); + return newArr; } \ No newline at end of file