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,4 @@
 export function triangleArea(base, height) { 
   // your code here
+  return base*height/2;
 } 

03-maxValue/index.js

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

04-fibonacci/index.js

@@ -1,4 +1,8 @@
 export function fibonacci(value) {
   // implementar logica aqui
-  
+  const arr = [0, 1]
+  for(let i = 1; i<value; i++){
+      arr.push(arr[i]+arr[i-1])
+  }
+  return arr[value]
 }

05-isPrime/index.js

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

06-sum/index.js

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

07-sumEven/index.js

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

08-isAnagram/index.js

@@ -1,4 +1,4 @@
 export function isAnagram(word1, word2) {
   // implementar logica aqui
-  
+  return word1.toLowerCase().split('').sort().join("") == word2.toLowerCase().split('').sort().join("")
 }

09-mostRepeatedChar/index.js

@@ -1,4 +1,23 @@
 export function mostUsedChar(text) {
     // implementar logica aqui
-    return ""
+    let caracMax
+    let qtdd = 0
+    let qtdd2 = 0
+
+    for(let i = 0; i < text.length; i++){
+        for(let j = 0; j < text.length; j++){
+            if(text[i] == text[j]){
+                qtdd2 = qtdd2 + 1
+            }
+        }
+
+        if(qtdd2 > qtdd){
+            caracMax = text[i]
+            qtdd = qtdd2
+        }
+
+        qtdd2 = 0
+    }
+
+    return caracMax
 }

10-longestWords/index.js

@@ -1,4 +1,13 @@
 export function longestWords(words) {
     // implementar logica aqui
-    
+    let arr = [''];
+
+    for(let i = 0; i < words.length; i++){
+        if(words[i].length > arr[0].length){
+            arr = [words[i]];
+        }else if(words[i].length == arr[0].length){
+            arr.push(words[i]);
+        }
+    }
+    return arr;
 }