Nov 9

Author: Mohammad

src/test/kotlin/com/igorwojda/integer/fibonacci/basic/Challenge.kt

@@ -16,23 +16,19 @@ fun main() {
 }*/
 
 private fun fibonacci(n: Int): Int {
-    if (n < 2) {
-        return n
-    }
-
     var first = 0
     var second = 1
-    var current = 0
+    val listItems: MutableList<Int> = mutableListOf<Int>(first, second)
 
-    (2..n).forEach {
-        println("it value --> $n")
-        current = first + second
+    if (n == 0) return 0
+    (2 until n).forEach { _ ->
+        val next = first + second
+        listItems.add(next)
         first = second
-        second = current
-        println("it current value --> $current")
+        second = next
     }
-
-    return current
+    println("fib list --> $listItems")
+    return listItems.sum()
 }
 
 private class Test {

src/test/kotlin/com/igorwojda/integer/fizzbuzz/Challenge.kt

@@ -22,17 +22,26 @@ private fun fizzBuzz(n: Int): List<String> {
         }
     }*/
 
-    (1 until n +1).forEach {
+    /*(1 until n +1).forEach {
         val item  = when {
             (it % 3 == 0 && it % 5 == 0) -> { "FizzBuzz" }
             (it % 3 == 0) -> { "Fizz" }
             (it % 5 == 0) -> { "Buzz" }
             else -> { it.toString() }
         }
         fizzBuzzList.add(item)
-    }
+    }*/
 
-    return fizzBuzzList
+    for (i in n   downTo 1) {
+        val item = when {
+            (i % 3 == 0 && i % 5 == 0) -> { "FizzBuzz" }
+            (i % 3 == 0) -> { "Fizz" }
+            (i % 5 == 0) -> { "Buzz" }
+            else -> { i.toString() }
+        }
+        fizzBuzzList.add(item)
+    }
+    return fizzBuzzList.reversed()
 }
 
 private class Test {

src/test/kotlin/com/igorwojda/integer/generateallpairs/Challenge.kt

@@ -6,14 +6,18 @@ import org.junit.jupiter.api.Test
 fun main() {
     getAllPairs(10)
 }
+
 private fun getAllPairs(n: Int): List<Pair<Int, Int>> {
-    val listPairValue = arrayListOf<Pair<Int, Int>>()
-    (0 until n + 1).forEach { i ->
-        (0 until n + 1).forEach { j ->
-            listPairValue.add(i to j)
+    val pairedList: MutableList<Pair<Int, Int>> = mutableListOf()
+    (0 until n).forEach { i ->
+        // for every i
+        (0 until n).forEach { j ->
+            // take every j and attach
+            pairedList.add(Pair(i, j))
         }
     }
-    return listPairValue
+    println(pairedList)
+    return pairedList
 }
 
 private class Test {

src/test/kotlin/com/igorwojda/integer/power/Challenge.kt

@@ -4,7 +4,14 @@ import org.amshove.kluent.shouldBeEqualTo
 import org.junit.jupiter.api.Test
 
 private fun power(base: Int, exponent: Int): Int {
-    TODO("not implemented")
+    // loop through the exponent and multiply the result variable with base that many times and return
+    var result = 1
+    if (base == 0) return 0
+    for (power in 0 until exponent) {
+        println("loop data:$power  $result")
+        result *= base
+    }
+    return result
 }
 
 private class Test {

src/test/kotlin/com/igorwojda/integer/printnumber/steps/Challenge.kt

@@ -3,8 +3,17 @@ package com.igorwojda.integer.printnumber.steps
 import org.amshove.kluent.shouldBeEqualTo
 import org.junit.jupiter.api.Test
 
-private fun printNumber(n: Int, step: Int = 1): List<Int> {
-    TODO("not implemented")
+private fun printNumber(n: Int, step: Int): List<Int> {
+    // Use a while loop, that helps to reduce via step while iterating with the reduced value
+    if (n == 0) return emptyList()
+    val resultList: MutableList<Int> = mutableListOf<Int>()
+    var current = n
+    while(current > 0) {
+        println(current)
+        resultList.add(current)
+        current -= step
+    }
+    return resultList
 }
 
 private class Test {