diff --git a/01-greeting/index.js b/01-greeting/index.js
index 8f551af..5c0279c 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..bc6458b 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..daba193 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 values.length;
+  }
+
+  return Math.max(...values)
 }
\ No newline at end of file
diff --git a/04-fibonacci/index.js b/04-fibonacci/index.js
index 37c64cc..4c85a16 100644
--- a/04-fibonacci/index.js
+++ b/04-fibonacci/index.js
@@ -1,4 +1,16 @@
 export function fibonacci(value) {
   // implementar logica aqui
   
+  let soma = 0;
+  let anterior = 0;
+  let proximo = 1;
+
+  for (let i = 0; i < value; i++) {
+    soma = anterior + proximo;
+    anterior = proximo;
+    proximo = soma;
+  }
+
+  return anterior;
+
 }
\ No newline at end of file
diff --git a/05-isPrime/index.js b/05-isPrime/index.js
index ec9c4ac..5c8f71f 100644
--- a/05-isPrime/index.js
+++ b/05-isPrime/index.js
@@ -1,4 +1,9 @@
 export function isPrime(value) {
   // implementar logica aqui
-  
+  for (let i = 2; i < value; i++)
+            if (value % i === 0) {
+              return false;
+            }
+
+            return value > 1;
 }
\ No newline at end of file
diff --git a/06-sum/index.js b/06-sum/index.js
index ebc2ee1..4c0b742 100644
--- a/06-sum/index.js
+++ b/06-sum/index.js
@@ -1,4 +1,4 @@
 export function sum(values) {
   // implementar logica aqui
-  
+  return values.reduce((firstValue, secondValue) => firstValue + secondValue, 0)
 }
\ No newline at end of file
diff --git a/07-sumEven/index.js b/07-sumEven/index.js
index bb1e095..07242a3 100644
--- a/07-sumEven/index.js
+++ b/07-sumEven/index.js
@@ -1,4 +1,12 @@
 export function sumEven(value) {
   // implementar logica aqui
-  
+  let soma = 0
+
+        for (let i = 0; i < value.length; i++) {
+          
+          if (value[i] % 2 === 0) {
+              soma += value[i]
+          }
+        }
+        return soma;
 }
\ No newline at end of file
diff --git a/08-isAnagram/index.js b/08-isAnagram/index.js
index 918308a..98f98ff 100644
--- a/08-isAnagram/index.js
+++ b/08-isAnagram/index.js
@@ -1,4 +1,6 @@
 export function isAnagram(word1, word2) {
   // implementar logica aqui
-  
-}
\ No newline at end of file
+	return word1.toLowerCase().split("").sort().join() === word2.toLowerCase().split("").sort().join();
+	
+		
+	}
diff --git a/09-mostRepeatedChar/index.js b/09-mostRepeatedChar/index.js
index b113ed8..87367f7 100644
--- a/09-mostRepeatedChar/index.js
+++ b/09-mostRepeatedChar/index.js
@@ -1,4 +1,17 @@
 export function mostUsedChar(text) {
     // implementar logica aqui
-    return ""
+    
+    let max = 0;
+    let maxCaracter = "";
+
+    text.split('').forEach((caracter) => {
+        if (text.split(caracter).length > max) {
+            max = text.split(caracter).length;
+
+            maxCaracter = caracter;
+        }
+    });
+    
+    
+    return maxCaracter;
 }
\ No newline at end of file
diff --git a/10-longestWords/index.js b/10-longestWords/index.js
index a98d2d8..9134806 100644
--- a/10-longestWords/index.js
+++ b/10-longestWords/index.js
@@ -1,4 +1,26 @@
 export function longestWords(words) {
     // implementar logica aqui
-    
-}
\ No newline at end of file
+   
+    let longestLength = 0;
+    let longestWords = [];
+  
+    words.forEach(word => {
+      if (longestLength < word.length) {
+        longestLength = word.length;
+      } else {
+        longestLength;
+      }
+
+    });
+  
+    words.forEach(word => {
+      if (word.length === longestLength) {
+        longestWords.push(word);
+      }
+    });
+  
+    return longestWords;
+  }
+
+
+