diff --git a/01-greeting/index.js b/01-greeting/index.js
index 8f551af..c1211f1 100644
--- a/01-greeting/index.js
+++ b/01-greeting/index.js
@@ -1,4 +1,4 @@
 export function greet(name) {
   // implementar logica aqui
-  return "";
+  return "Hello " + name;
 }
diff --git a/02-triangleArea/index.js b/02-triangleArea/index.js
index 7628fcd..d63c4fd 100644
--- a/02-triangleArea/index.js
+++ b/02-triangleArea/index.js
@@ -1,3 +1,4 @@
 export function triangleArea(base, height) { 
   // your code here
+  return base * height / 2;
 } 
\ No newline at end of file
diff --git a/03-maxValue/index.js b/03-maxValue/index.js
index e433b31..2c7394d 100644
--- a/03-maxValue/index.js
+++ b/03-maxValue/index.js
@@ -1,4 +1,8 @@
 export function maxValue(values) {
   // implementar logica aqui
+  if (values.length == 0) {
+    return 0 
+    }
+  return Math.max(...values);
   
 }
\ No newline at end of file
diff --git a/04-fibonacci/index.js b/04-fibonacci/index.js
index 37c64cc..a81a5de 100644
--- a/04-fibonacci/index.js
+++ b/04-fibonacci/index.js
@@ -1,4 +1,14 @@
 export function fibonacci(value) {
   // implementar logica aqui
-  
+  if (value < 1) return 0
+  if (value <= 2) return 1
+  let fibAnterior = 0
+  let fibProximo = 1
+  let fibValue = value
+  for(let i = 2; i <= value; i++){
+    fibValue = fibProximo + fibAnterior
+    fibAnterior = fibProximo
+    fibProximo = fibValue
+  }
+  return fibValue
 }
\ No newline at end of file
diff --git a/05-isPrime/index.js b/05-isPrime/index.js
index ec9c4ac..4e8749b 100644
--- a/05-isPrime/index.js
+++ b/05-isPrime/index.js
@@ -1,4 +1,6 @@
 export function isPrime(value) {
   // implementar logica aqui
-  
+  for (let divisão = 2; divisão < value; divisão++) 
+    if (value % divisão == 0) return false;
+    return true;
 }
\ No newline at end of file
diff --git a/06-sum/index.js b/06-sum/index.js
index ebc2ee1..f3a0f55 100644
--- a/06-sum/index.js
+++ b/06-sum/index.js
@@ -1,4 +1,9 @@
 export function sum(values) {
   // implementar logica aqui
-  
+  let total =  0;
+  for(let i = 0; i < values.length;i++)
+    {                  
+        total += values[i];
+      }
+    return total;
 }
\ No newline at end of file
diff --git a/07-sumEven/index.js b/07-sumEven/index.js
index bb1e095..a8e1efe 100644
--- a/07-sumEven/index.js
+++ b/07-sumEven/index.js
@@ -1,4 +1,16 @@
 export function sumEven(value) {
   // implementar logica aqui
-  
+  let total = 0
+  let even = []
+
+  for (let i = 0; i < value.length; i++) {
+    if (value[i] % 2 == 0) {
+      even.push(value[i])
+    }
+  }
+  for (let i = 0; i < even.length; i++)
+    {                  
+      total += even[i];
+    }
+    return total;
 }
\ No newline at end of file
diff --git a/08-isAnagram/index.js b/08-isAnagram/index.js
index 918308a..6b4cc8f 100644
--- a/08-isAnagram/index.js
+++ b/08-isAnagram/index.js
@@ -1,4 +1,12 @@
 export function isAnagram(word1, word2) {
   // implementar logica aqui
+  if (word1.length !== word2.length) {
+    return false;
+  }
   
-}
\ No newline at end of file
+  let palavra1 = word1.toLowerCase().split('').sort().join('');
+  let palavra2 = word2.toLowerCase().split('').sort().join('');
+
+  let result = (palavra1 === palavra2);
+  return result;
+}
diff --git a/09-mostRepeatedChar/index.js b/09-mostRepeatedChar/index.js
index b113ed8..ad0fa71 100644
--- a/09-mostRepeatedChar/index.js
+++ b/09-mostRepeatedChar/index.js
@@ -1,4 +1,13 @@
 export function mostUsedChar(text) {
     // implementar logica aqui
-    return ""
+
+    let maxLetter = 0;
+    let mostUsed = '';
+    text.split('').forEach((letter) => {
+        if (text.split(letter).length > maxLetter) {
+        maxLetter = text.split(letter).length;
+        mostUsed = letter;
+        }
+    })
+    return mostUsed;
 }
\ No newline at end of file
diff --git a/10-longestWords/index.js b/10-longestWords/index.js
index a98d2d8..fb9d583 100644
--- a/10-longestWords/index.js
+++ b/10-longestWords/index.js
@@ -1,4 +1,13 @@
 export function longestWords(words) {
     // implementar logica aqui
-    
-}
\ No newline at end of file
+
+    return words.reduce((longest, sentence, i) => {
+        if (!i || longest[0].length < sentence.length) {
+           return [sentence];
+        }
+        if (longest[0].length === sentence.length) {
+           longest.push(sentence);
+        }
+        return longest;
+     }, []);
+  }
\ No newline at end of file