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..2e2feba 100644
--- a/02-triangleArea/index.js
+++ b/02-triangleArea/index.js
@@ -1,3 +1,3 @@
 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..196773d 100644
--- a/03-maxValue/index.js
+++ b/03-maxValue/index.js
@@ -1,4 +1,5 @@
 export function maxValue(values) {
   // implementar logica aqui
-  
+  if (values.length === 0) return 0;
+  return Math.max.apply(null, values);
 }
\ No newline at end of file
diff --git a/04-fibonacci/index.js b/04-fibonacci/index.js
index 37c64cc..c16fc61 100644
--- a/04-fibonacci/index.js
+++ b/04-fibonacci/index.js
@@ -1,4 +1,8 @@
 export function fibonacci(value) {
   // implementar logica aqui
-  
+  if (value === 0 || value === 1) {
+    return value;
+  } else {
+    return fibonacci(value - 1) + fibonacci(value - 2);
+  }
 }
\ No newline at end of file
diff --git a/05-isPrime/index.js b/05-isPrime/index.js
index ec9c4ac..44128c2 100644
--- a/05-isPrime/index.js
+++ b/05-isPrime/index.js
@@ -1,4 +1,5 @@
 export function isPrime(value) {
-  // implementar logica aqui
-  
+  var start = 2;
+  while (start <= Math.sqrt(value)) if (value % start++ < 1) 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..23c46e3 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((acc, cur) => acc + cur, 0)
 }
\ No newline at end of file
diff --git a/07-sumEven/index.js b/07-sumEven/index.js
index bb1e095..1233b25 100644
--- a/07-sumEven/index.js
+++ b/07-sumEven/index.js
@@ -1,4 +1,11 @@
 export function sumEven(value) {
   // implementar logica aqui
-  
+  if (value.length === 0) return 0;
+  let soma = 0;
+    for(let i = 0; i < value.length; i ++){
+    if(value[i] % 2 === 0){
+      soma = 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..f2469ec 100644
--- a/08-isAnagram/index.js
+++ b/08-isAnagram/index.js
@@ -1,4 +1,10 @@
 export function isAnagram(word1, word2) {
   // implementar logica aqui
-  
+  const word1LowerCase = word1.toLowerCase();
+  const word2LowerCase = word2.toLowerCase();
+
+  const word1Sorted = word1LowerCase.split('').sort().join('');
+  const word2Sorted = word2LowerCase.split('').sort().join('');
+
+  return word1Sorted === word2Sorted;
 }
\ No newline at end of file
diff --git a/09-mostRepeatedChar/index.js b/09-mostRepeatedChar/index.js
index b113ed8..e993202 100644
--- a/09-mostRepeatedChar/index.js
+++ b/09-mostRepeatedChar/index.js
@@ -1,4 +1,23 @@
 export function mostUsedChar(text) {
     // implementar logica aqui
-    return ""
+    const charMap = {};
+    let max = 0;
+    let frequentChar = '';
+
+    for (let char of text) {
+        if (charMap[char]){
+            charMap[char]++;
+        } else {
+            charMap[char] = 1;
+        }
+    }
+
+    for (let char in charMap) {
+        if (charMap[char] > max) {
+            max = charMap[char];
+            frequentChar = char;
+        }
+    }
+
+    return frequentChar
 }
\ No newline at end of file
diff --git a/10-longestWords/index.js b/10-longestWords/index.js
index a98d2d8..d6dfaec 100644
--- a/10-longestWords/index.js
+++ b/10-longestWords/index.js
@@ -1,4 +1,19 @@
 export function longestWords(words) {
     // implementar logica aqui
-    
-}
\ No newline at end of file
+    const longestWords = [];
+    let longest = '';
+
+    for (let i = 0; i < words.length; i++) {
+        if (words[i].length > longest.length) {
+            longest = words[i];
+        }
+    }
+
+    for (let i = 0; i < words.length; i++) {
+        if (words[i].length === longest.length) {
+            longestWords.push(words[i]);
+        }
+    }
+
+    return longestWords;
+}