Merge pull request 'Entrega do Desafio' (#1) from feature/10-longestWords into master

Reviewed-on: #1

01-greeting/index.js

@@ -1,4 +1,4 @@
 export function greet(name) {
   // implementar logica aqui
-  return "";
+  return `Hello ${name}`;
 }

02-triangleArea/index.js

@@ -1,3 +1,5 @@
 export function triangleArea(base, height) { 
   // your code here
+  let area = (base * height)/2;
+  return area;
 } 

03-maxValue/index.js

@@ -1,4 +1,12 @@
 export function maxValue(values) {
   // implementar logica aqui
-  
+  if (values.length) {
+    let max = -Infinity;
+
+    for (let num of values) {
+      max = num > max ? num : max;
+    }
+    return max;
+  }
+  return 0;
 }

04-fibonacci/index.js

@@ -1,4 +1,5 @@
 export function fibonacci(value) {
   // implementar logica aqui
-  
+  var sqrt5 = Math.sqrt(5);
+  return Math.round(Math.pow(((1 + sqrt5) / 2), value) / sqrt5);
 }

05-isPrime/index.js

@@ -1,4 +1,8 @@
 export function isPrime(value) {
   // implementar logica aqui
-  
+  for (let i = 2; i < value; i++)
+    if (value % i === 0) {
+      return false;
+  }
+  return value > 1;
 }

06-sum/index.js

@@ -1,4 +1,8 @@
 export function sum(values) {
   // implementar logica aqui
-  
+  let sumOfArrays = 0;
+    for(let index = 0; index < values.length; index +=1) {
+      sumOfArrays = sumOfArrays + values[index];
+    }
+  return sumOfArrays;
 }

07-sumEven/index.js

@@ -1,4 +1,10 @@
 export function sumEven(value) {
   // implementar logica aqui
-  
+  let sumOfEven = 0;
+    for (let i = 0; i < value.length; i++) {
+      if (value[i] % 2 === 0) {
+          sumOfEven = sumOfEven + value[i];
+      }
+    }
+  return sumOfEven;
 }

08-isAnagram/index.js

@@ -1,4 +1,11 @@
 export function isAnagram(word1, word2) {
   // implementar logica aqui
-  
+  const Anagram = str =>
+    str
+    .toLowerCase()
+    .replace(/[^a-z0-9]/gi, '')
+    .split('')
+    .sort()
+    .join('');
+    return Anagram(word1) === Anagram(word2);
 }

09-mostRepeatedChar/index.js

@@ -1,4 +1,12 @@
 export function mostUsedChar(text) {
     // implementar logica aqui
-    return ""
+    let max = 0,
+        maxChar = '';
+        text.split('').forEach(function(char){
+            if(text.split(char).length > max) {
+                max = text.split(char).length;
+                maxChar = char;
+            }
+        });
+    return maxChar;
 }

10-longestWords/index.js

@@ -1,4 +1,5 @@
 export function longestWords(words) {
     // implementar logica aqui
-    
+    let maxWord = Math.max(...words.map( elem => elem.length))
+    return words.filter(elem => elem.length === maxWord)
 }