Merge pull request 'feature/algoritimos' (#1) from feature/algoritimos 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,4 @@
 export function triangleArea(base, height) { 
   // your code here
+  return base * height /2 ;
 } 

03-maxValue/index.js

@@ -1,4 +1,8 @@
 export function maxValue(values) {
   // implementar logica aqui
-  
+  if(values.length === 0){
+    return 0
+  } else {
+    return Math.max(...values)
+  }
 }

04-fibonacci/index.js

@@ -1,4 +1,25 @@
 export function fibonacci(value) {
   // implementar logica aqui
+  if(value < 1) return 0
+  if(value <=2) return 1
+  let fibMin2 = 0
+  let fibMin1 = 1
+  let fibValue = value
+  for(let i = 2; i <= value; i++) {
+      fibValue = fibMin1 + fibMin2
+      fibMin2 = fibMin1
+      fibMin1 = fibValue
+  }
+  return fibValue
+
+// Forma inicial pensada, mas demorava muito tempo para passar nos testes.
+
+  // if(value === 0) {
+  //   return 0
+  // }
+  // else if (value <= 2) {
+  //   return 1
+  // } 
+  // return fibonacci(value - 1) + fibonacci(value - 2);
  
 }

05-isPrime/index.js

@@ -1,4 +1,6 @@
 export function isPrime(value) {
   // implementar logica aqui
-  
+  var start = 2;
+  while (start <= Math.sqrt(value)) if (value % start++ < 1) return false;
+  return value > 1;
 }

06-sum/index.js

@@ -1,4 +1,8 @@
 export function sum(values) {
   // implementar logica aqui
-  
+  let soma = 0
+  for(let i in values) {
+    soma += values[i]
+  }
+  return soma
 }

07-sumEven/index.js

@@ -1,4 +1,11 @@
 export function sumEven(value) {
   // implementar logica aqui
-  
+  var retorno = value.filter(pares => (pares %2)== 0);
+  let soma = 0
+  for(let i in retorno) {
+    soma += retorno[i]
   }
+  return soma
+} 
+
+

08-isAnagram/index.js

@@ -1,4 +1,13 @@
 export function isAnagram(word1, word2) {
   // implementar logica aqui
-  
+  let word1Lower = word1.toLowerCase()
+  let word2Lower = word2.toLowerCase()
+  if (word1Lower.length !== word2Lower.length) {
+    return false;
+}
+var string1 = word1Lower.split('').sort().join(''); 
+var string2 = word2Lower.split('').sort().join('');
+
+var result = (string1 === string2);
+return result;
 }

09-mostRepeatedChar/index.js

@@ -1,4 +1,11 @@
 export function mostUsedChar(text) {
-    // implementar logica aqui
+    let max = 0,
-    return ""
+        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,11 @@
 export function longestWords(words) {
     // implementar logica aqui
-    
+        let longest = '';
+        for (let word of words) {
+          if (word.length > longest.length) {
+            longest = word;
+          }
+        }
+      
+        return words.filter((word) => word.length === longest.length);
       }