Merge pull request 'feature/algoritmos' (#1) from feature/algoritmos into master

Reviewed-on: #1

01-greeting/index.js

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

02-triangleArea/index.js

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

03-maxValue/index.js

@@ -1,4 +1,15 @@
 export function maxValue(values) {
-  // implementar logica aqui
+  let max = 0;
+  max = values[0];
   
+  if (values.length === 0){
+    return 0;
+  }
+
+  for(let i= 0; i < values.length; i++) {
+    if (values[i] > max) {
+      max = values[i];
+  }
+}
+  return max;
 }

04-fibonacci/index.js

@@ -1,4 +1,14 @@
 export function fibonacci(value) {
-  // implementar logica aqui
+  //
+  let previous = 0; 
+  let sum = 0;
+  let next = 1;
+
+  for (let i = 0; i < value; i++) {
+    sum = previous + next;
+    previous = next;
+    next = sum;
+  }
+  return previous;
   
 }

05-isPrime/index.js

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

06-sum/index.js

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

07-sumEven/index.js

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

08-isAnagram/index.js

@@ -1,4 +1,19 @@
 export function isAnagram(word1, word2) {
-  // implementar logica aqui
+  let testWord1;
-  
+  let testWord2;
+
+  if (word1.length !== word2.length) {
+    return false;
+  }
+
+
+  testWord1 = word1.toLowerCase('').split('').sort().join('');
+  testWord2 = word2.toLowerCase('').split('').sort().join('');
+
+  if (testWord1 === testWord2) {
+    return true;
+  }
+
+  return false;
+
 }

09-mostRepeatedChar/index.js

@@ -1,4 +1,19 @@
 export function mostUsedChar(text) {
-    // implementar logica aqui
+    let arrChar;
-    return ""
+    arrChar = text.split('');
-}
+    let countCharMax = 1;
+    let countChar = 0;
+    let char;
+    for (let i=0; i<arrChar.length; i++)
+    {
+        for (let j=i; j<arrChar.length; j++) {
+            if (arrChar[i] == arrChar[j])
+            countChar++;
+            if (countCharMax<countChar) {
+                countCharMax=countChar; 
+                char = arrChar[i];
+            }
+        }
+        countChar = 0;
+    } return char;
+}

10-longestWords/index.js

@@ -1,4 +1,10 @@
 export function longestWords(words) {
-    // implementar logica aqui
+    let longWord = "";
-    
+    let word;
+    for(word of words) {
+        if (word.length > longWord.length){ 
+            longWord = word;
+        }
+    }
+    return words.filter((word) => word.length === longWord.length);
 }