From ac28a3158f74c19d068e3c456332c21663854af7 Mon Sep 17 00:00:00 2001
From: Heraldo Ecard Roque Filho <me@heraldo.tech>
Date: Wed, 18 Aug 2021 18:00:43 -0300
Subject: [PATCH] adicionado desafios

---
 01-greeting/index.html                | 30 +++++++++++++++++++++
 02-area-do-triangulo/index.html       | 30 +++++++++++++++++++++
 03-max-value/index.html               | 31 +++++++++++++++++++++
 04-fibonnaci/index.html               | 36 +++++++++++++++++++++++++
 05-é-primo/index.html                | 39 +++++++++++++++++++++++++++
 06-soma-dos-elementos/index.html      | 31 +++++++++++++++++++++
 07-soma-dos-pares/index.html          | 31 +++++++++++++++++++++
 09-caractere-mais-repetido/index.html | 31 +++++++++++++++++++++
 8 files changed, 259 insertions(+)
 create mode 100644 01-greeting/index.html
 create mode 100644 02-area-do-triangulo/index.html
 create mode 100644 03-max-value/index.html
 create mode 100644 04-fibonnaci/index.html
 create mode 100644 05-é-primo/index.html
 create mode 100644 06-soma-dos-elementos/index.html
 create mode 100644 07-soma-dos-pares/index.html
 create mode 100644 09-caractere-mais-repetido/index.html
diff --git a/01-greeting/index.html b/01-greeting/index.html
new file mode 100644
index 0000000..fd1a9d6
--- /dev/null
+++ b/01-greeting/index.html
@@ -0,0 +1,30 @@
+<!DOCTYPE html>
+<html lang="en">
+
+<head>
+    <meta charset="UTF-8">
+    <meta http-equiv="X-UA-Compatible" content="IE=edge">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Document</title>
+</head>
+
+<body>
+
+    <script>
+        /* 
+            Faça um algoritmo que retorne a string composta por Hello e o nome passado
+        */
+        function greet(name) {
+            // implementar logica aqui
+            return ""
+        }
+
+        // Resultados esperados
+        console.log(greet("Maria"), "Hello Maria") // Hello Maria
+        console.log(greet("Alvin"), "Hello Alvin") // Hello Alvin
+        console.log(greet("Pedro Lucas"), "Hello Pedro Lucas") // Pedro Lucas
+
+    </script>
+</body>
+
+</html>
\ No newline at end of file
diff --git a/02-area-do-triangulo/index.html b/02-area-do-triangulo/index.html
new file mode 100644
index 0000000..c2f2000
--- /dev/null
+++ b/02-area-do-triangulo/index.html
@@ -0,0 +1,30 @@
+<!DOCTYPE html>
+<html lang="en">
+
+<head>
+    <meta charset="UTF-8">
+    <meta http-equiv="X-UA-Compatible" content="IE=edge">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Document</title>
+</head>
+
+<body>
+
+    <script>
+        /* 
+            Faça um algoritmo para calcular a area de um triangulo
+        */
+        function triangleArea(base, height) {
+            // implementar logica aqui
+            return 0
+        }
+
+        // Resultados esperados
+        console.log(triangleArea(3, 5), 7.5) // 7.5
+        console.log(triangleArea(5, 5), 12.5) // 12.5
+        console.log(triangleArea(2, 5), 5) // 5
+
+    </script>
+</body>
+
+</html>
\ No newline at end of file
diff --git a/03-max-value/index.html b/03-max-value/index.html
new file mode 100644
index 0000000..893f918
--- /dev/null
+++ b/03-max-value/index.html
@@ -0,0 +1,31 @@
+<!DOCTYPE html>
+<html lang="en">
+
+<head>
+    <meta charset="UTF-8">
+    <meta http-equiv="X-UA-Compatible" content="IE=edge">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Document</title>
+</head>
+
+<body>
+
+    <script>
+        /* 
+            Faça um algoritmo que retorne o maior numero encontrado no array
+        */
+        function maxValue(values) {
+            // implementar logica aqui
+            return 0
+        }
+
+        // Resultados esperados
+        console.log(maxValue([4,6,12,5]), 12) // 12
+        console.log(maxValue([9, 234, 312, 999, 21 , 2311]), 2311) // 2311
+        console.log(maxValue([533, 234, 23423, 32, 432]), 23423) // 23423
+        console.log(maxValue([5, 4, 3, 2, 1]), 5) // 5
+
+    </script>
+</body>
+
+</html>
\ No newline at end of file
diff --git a/04-fibonnaci/index.html b/04-fibonnaci/index.html
new file mode 100644
index 0000000..2500754
--- /dev/null
+++ b/04-fibonnaci/index.html
@@ -0,0 +1,36 @@
+<!DOCTYPE html>
+<html lang="en">
+
+<head>
+    <meta charset="UTF-8">
+    <meta http-equiv="X-UA-Compatible" content="IE=edge">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Document</title>
+</head>
+
+<body>
+
+    <script>
+        /* 
+            Faça um algoritmo que resolva a função de fibonnaci
+            Fibonnaci: https://pt.wikipedia.org/wiki/Sequ%C3%AAncia_de_Fibonacci
+        */
+        function fib(values) {
+            // implementar logica aqui
+            return 0
+        }
+
+        // Resultados esperados
+        console.log(fib(0), 0) // 0
+        console.log(fib(1), 1) // 1
+        console.log(fib(2), 1) // 1
+        console.log(fib(3), 2) // 2
+        console.log(fib(4), 3) // 3
+        console.log(fib(5), 5) // 5
+        console.log(fib(35), 9227465) // 9227465
+        console.log(fib(46), 1836311903) // 1836311903
+
+    </script>
+</body>
+
+</html>
\ No newline at end of file
diff --git a/05-é-primo/index.html b/05-é-primo/index.html
new file mode 100644
index 0000000..cd11c0c
--- /dev/null
+++ b/05-é-primo/index.html
@@ -0,0 +1,39 @@
+<!DOCTYPE html>
+<html lang="en">
+
+<head>
+    <meta charset="UTF-8">
+    <meta http-equiv="X-UA-Compatible" content="IE=edge">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Document</title>
+</head>
+
+<body>
+
+    <script>
+        /* 
+            Faça um algoritmo que retorne se o numero passado é primo ou não
+        */
+        function isPrime(number) {
+            // implementar logica aqui
+            return false
+        }
+
+        // Resultados esperados
+        console.log(isPrime(2), true) // true
+        console.log(isPrime(3), true) // true
+        console.log(isPrime(4), false) // false
+        console.log(isPrime(5), true) // true
+        console.log(isPrime(6), false) // false
+        console.log(isPrime(7), true) // true
+        console.log(isPrime(8), false) // false
+        console.log(isPrime(25), false) // false
+        console.log(isPrime(31), true) // true
+        console.log(isPrime(2017), true) // true
+        console.log(isPrime(2048), false) // false
+        console.log(isPrime(1), false) // false
+
+    </script>
+</body>
+
+</html>
\ No newline at end of file
diff --git a/06-soma-dos-elementos/index.html b/06-soma-dos-elementos/index.html
new file mode 100644
index 0000000..3d50c2d
--- /dev/null
+++ b/06-soma-dos-elementos/index.html
@@ -0,0 +1,31 @@
+<!DOCTYPE html>
+<html lang="en">
+
+<head>
+    <meta charset="UTF-8">
+    <meta http-equiv="X-UA-Compatible" content="IE=edge">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Document</title>
+</head>
+
+<body>
+
+    <script>
+        /* 
+            Faça um algoritmo que retorne a soma de todos os numeros de um array
+        */
+        function sum(numbers) {
+            // implementar logica aqui
+            return 0
+        }
+
+        // Resultados esperados
+        console.log(sum([4,6,12,5]), 27) // 27
+        console.log(sum([9, 234, 312, 999, 21 , 2311]), 3886) // 3886
+        console.log(sum([533, 234, 23423, 32, 48876]), 73098 ) // 73098 
+        console.log(sum([5, 4, 3, 2, 1]), 15 ) // 15
+
+    </script>
+</body>
+
+</html>
\ No newline at end of file
diff --git a/07-soma-dos-pares/index.html b/07-soma-dos-pares/index.html
new file mode 100644
index 0000000..9b617fa
--- /dev/null
+++ b/07-soma-dos-pares/index.html
@@ -0,0 +1,31 @@
+<!DOCTYPE html>
+<html lang="en">
+
+<head>
+    <meta charset="UTF-8">
+    <meta http-equiv="X-UA-Compatible" content="IE=edge">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Document</title>
+</head>
+
+<body>
+
+    <script>
+        /* 
+            Faça um algoritmo que retorne a soma de todos os numeros pares de um array
+        */
+        function sum(numbers) {
+            // implementar logica aqui
+            return 0
+        }
+
+        // Resultados esperados
+        console.log(sum([4, 6, 12, 5]), 22) // 22 
+        console.log(sum([9, 234, 312, 999, 21, 2311]), 546) // 546 
+        console.log(sum([533, 234, 23423, 32, 48876]), 49142) // 49142  
+        console.log(sum([5, 4, 3, 2, 1]), 6) // 6
+
+    </script>
+</body>
+
+</html>
\ No newline at end of file
diff --git a/09-caractere-mais-repetido/index.html b/09-caractere-mais-repetido/index.html
new file mode 100644
index 0000000..be8d80e
--- /dev/null
+++ b/09-caractere-mais-repetido/index.html
@@ -0,0 +1,31 @@
+<!DOCTYPE html>
+<html lang="en">
+
+<head>
+    <meta charset="UTF-8">
+    <meta http-equiv="X-UA-Compatible" content="IE=edge">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Document</title>
+</head>
+
+<body>
+
+    <script>
+        /* 
+            Faça um algoritmo que retorne a a letra mias repetida de uma string
+        */
+        function mostUsedChar(text) {
+            // implementar logica aqui
+            return ""
+        }
+
+        // Resultados esperados
+        console.log(mostUsedChar("fdgdfgff"), 'f') // f
+        console.log(mostUsedChar("Lorem ipsum"), 'm') // m
+        console.log(mostUsedChar("adsassdasd"), 's') // s
+        console.log(mostUsedChar("testeeeee"), 'e') // e
+
+    </script>
+</body>
+
+</html>
\ No newline at end of file
