feat: adds Karens lesson_07.ts

Author: karensprojects22

lesson_07/conditionals/.env.test

@@ -1 +1 @@
-HW_VERSION=your homework version here
+HW_VERSION=D

lesson_07/conditionals/src/lesson7.ts

@@ -11,16 +11,13 @@ export function compareStrings(a: string, b: string): number {
   // The distance will be a number less than 0 if string `a` is lexicographically less than `b`, 1
   // if it is greater, and 0 if the strings are equal.
   const distance = computeLexicographicDistance(a, b);
-  if (distance < 0){ 
+  if (distance < 0) {
     return -1;
-  }
-  if (distance > 0)  {
-    return 1;
-  }
-  if (distance === 0) {
+  } else if (distance > 0) {
     return 1;
+  } else {
+    return 0;
   }
-  return 0;
 }
 
 /**
@@ -40,7 +37,20 @@ export function computeFactorial(n: number): number {
  * @return An array containing the first `n` Fibonacci values.
  */
 export function getFirstNFibonacciNumbers(n: number): number[] {
-  return [];
+  /* fibionacci formula - f(n) = f(n-1) + f(n-2)... */
+  if (n === 0) {
+    return [];
+  }
+  if (n === 1) {
+    return [1];
+  }
+  // create array
+  const number: number[] = [1, 1];
+  for (let i = 2; i < n; i++) {
+    //iterate thorugh items in array
+    number.push(number[i - 1] + number[i - 2]);
+  }
+  return number;
 }
 
 /**
@@ -71,5 +81,11 @@ export function binarySearch(
   // Else if values[pivotIndex] is greater than the value, then
   // call `binarySearch(values, start, pivotIndex - 1, value)` and return its value;
   // Else call `binarySearch(values, pivotIndex + 1, end, value)` and return its value.
-  return -1;
+  if (values[pivotIndex] === value) {
+    return pivotIndex;
+  } else if (values[pivotIndex] > value) {
+    return binarySearch(values, start, pivotIndex - 1, value);
+  } else {
+    return binarySearch(values, pivotIndex + 1, end, value);
+  }
 }

lesson_07/conditionals/src/part_d.ts

@@ -7,7 +7,7 @@
  * @returns
  */
 export function isWithinRange(num: number, min: number, max: number): boolean {
-  return false;
+  
 }
 
 /**