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

03-maxValue/index.js

@@ -1,4 +1,11 @@
 export function maxValue(values) {
   // implementar logica aqui
-  
+  if (values != `${[]}`) {
+    let max = values.reduce(function (a, b) {
+      return Math.max(a, b);
+    }, -Infinity);
+    return max;
+  } else {
+    return 0;
+  }
 }

04-fibonacci/index.js

@@ -1,4 +1,18 @@
 export function fibonacci(value) {
   // implementar logica aqui
-  
+  let penultimo = 0,
+    ultimo = 1;
+  let numero;
+  let arr = [];
+  if (value < 2) {
+    return value;
+  } else {
+    for (let count = 2; count <= value; count++) {
+      numero = ultimo + penultimo;
+      penultimo = ultimo;
+      ultimo = numero;
+      arr.push(ultimo);
+    }
+    return arr[value - 2];
+  }
 }

05-isPrime/index.js

@@ -1,4 +1,14 @@
 export function isPrime(value) {
   // implementar logica aqui
-  
+  let divisores = 0;
+  for (let index = 1; index <= value; index++) {
+    if (value % index == 0) {
+      divisores++;
+    }
+  }
+  if (divisores == 2) {
+    return true;
+  } else {
+    return false;
+  }
 }

06-sum/index.js

@@ -1,4 +1,8 @@
 export function sum(values) {
   // implementar logica aqui
-  
+  function add(a, b) {
+    return a + b;
+  }
+  var soma = values.reduce(add, 0);
+  return soma;
 }

07-sumEven/index.js

@@ -1,4 +1,15 @@
 export function sumEven(value) {
   // implementar logica aqui
-  
+  const arr = [];
+  for (let index = 0; index < value.length; index++) {
+    const element = value[index];
+    if (element % 2 == 0) {
+      arr.push(element);
+    }
+  }
+  function add(a, b) {
+    return a + b;
+  }
+  var soma = arr.reduce(add, 0);
+  return soma;
 }

08-isAnagram/index.js

@@ -1,4 +1,14 @@
 export function isAnagram(word1, word2) {
   // implementar logica aqui
-  
+  if (word1.length === word2.length) {
+    let word1Lower = word1.toLowerCase().split("").sort();
+    let word2Lower = word2.toLowerCase().split("").sort();
+    if (word1Lower.join() == word2Lower.join()) {
+      return true;
+    } else {
+      return false;
+    }
+  } else {
+    return false;
+  }
 }

09-mostRepeatedChar/index.js

@@ -1,4 +1,10 @@
 export function mostUsedChar(text) {
   // implementar logica aqui
-    return ""
+  let textLower = text.toLowerCase().split("").sort();
+  for (let index = 1; index < textLower.length; index++) {
+    textLower = textLower.filter((e, i, a) => a.indexOf(e) !== i);
+  }
+
+  let letter = [...new Set(textLower)];
+  return letter.join("");
 }

10-longestWords/index.js

@@ -1,4 +1,17 @@
 export function longestWords(words) {
   // implementar logica aqui
+  let max_string_size = 0;
+  let big_string_list = [];
 
+  for (let string of words) {
+    const string_size = string.length;
+
+    if (string_size > max_string_size) {
+      big_string_list = [string];
+      max_string_size = string_size;
+    } else if (string_size == max_string_size) {
+      big_string_list.push(string);
+    }
+  }
+  return big_string_list;
 }