My code interviews :D

fibonacci/imjulianeral.js

@@ -0,0 +1,26 @@
+// Code written by Jorge Julián Acero Lomelí (@imjulianeral)
+
+// Without Recursion:
+let sequence = []
+
+for (let i = 0; i < 10; i++) {
+  if (i <= 1) sequence = [...sequence, i]
+  else {
+    const currentNumber = sequence[i - 1]
+    const previousNumber = sequence[i - 2]
+
+    sequence = [...sequence, currentNumber + previousNumber]
+  }
+}
+console.log(sequence)
+
+// With Recursion:
+const fibonacci = N => {
+  if (N === 0 || N === 1) return N
+
+  return fibonacci(N - 2) + fibonacci(N - 1)
+}
+
+for (let i = 0; i < 10; i++) {
+  console.log(fibonacci(i))
+}

floyd-triangle/imjulianeral.js

@@ -0,0 +1,16 @@
+// Code written by Jorge Julián Acero Lomelí (@imjulianeral)
+
+let tempStr = '',
+  prevNumber = 1,
+  i,
+  depth = 10
+for (i = 0; i < depth; i++) {
+  tempStr = ''
+  j = 0
+  while (j <= i) {
+    tempStr = tempStr + '    ' + prevNumber
+    j++
+    prevNumber++
+  }
+  console.log(tempStr)
+}

hanoi-towers/imjulianeral.js

@@ -0,0 +1,11 @@
+// Code written by Jorge Julián Acero Lomelí (@imjulianeral)
+
+function TowerOfHanoi(n, fromRod, toRod, auxRod) {
+  if (n === 1) return console.log('Move disk', 1, 'from rod', fromRod, 'to rod', toRod)
+
+  TowerOfHanoi(n - 1, fromRod, auxRod, toRod)
+  console.log('Move disk', n, 'from rod', fromRod, 'to rod', toRod)
+  TowerOfHanoi(n - 1, auxRod, toRod, fromRod)
+}
+
+TowerOfHanoi(6, 'A', 'C', 'B')

palindrome/imjulianeral.js

@@ -0,0 +1,16 @@
+// Code written by Jorge Julián Acero Lomelí (@imjulianeral)
+
+const word = 'anita lava la tina'
+const cleanWord = word.replace(/\s/g, '')
+let counter = 0
+let reversed = []
+
+for (let i = cleanWord.length - 1; i >= 0; i--) {
+  reversed[counter++] = cleanWord[i]
+}
+
+if (cleanWord === reversed.join('')) {
+  console.log(`${word} is a palindrome`)
+} else {
+  console.log(`${word} is not a palindrome`)
+}