Completed: Loops for functions & Part_G Assmt

Author: dxbenson252

lesson_07/conditionals/.env.test

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

lesson_07/conditionals/src/lesson7.ts

@@ -13,8 +13,13 @@ export function compareStrings(a: string, b: string): number {
   const distance = computeLexicographicDistance(a, b);
 
   // TODO(you): Finish this method.
-
-  return 0;
+  if (distance < 0) {
+    return -1;
+  } else if (distance > 0) {
+    return 1;
+  } else {
+    return 0;
+  }
 }
 
 /**
@@ -24,7 +29,15 @@ export function compareStrings(a: string, b: string): number {
  * @return The factorial of n.
  */
 export function computeFactorial(n: number): number {
-  return 0;
+  if (n <= 0) {
+    return 1; // By convention, 0! = 1
+  }
+  
+  let result = 1;
+  for (let i = 1; i <= n; i++) {
+    result *= i;
+  }
+  return result;
 }
 
 /**
@@ -34,7 +47,24 @@ export function computeFactorial(n: number): number {
  * @return An array containing the first `n` Fibonacci values.
  */
 export function getFirstNFibonacciNumbers(n: number): number[] {
-  return [];
+  if (n <= 0) {
+    return [];
+  }
+  
+  if (n === 1) {
+    return [1];
+  }
+  
+  if (n === 2) {
+    return [1, 1];
+  }
+  
+  const fibonacci = [1, 1];
+  for (let i = 2; i < n; i++) {
+    fibonacci.push(fibonacci[i - 1] + fibonacci[i - 2]);
+  }
+  
+  return fibonacci;
 }
 
 /**
@@ -65,5 +95,12 @@ 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_g.ts

@@ -1,40 +1,48 @@
-/**
- * Finds the largest number in an array.
- *
- * @param numbers
- * @returns
- */
 export function findLargestNumber(numbers: number[]): number {
-  return 0;
+  if (numbers.length === 0) return 0;
+  
+  let largest = numbers[0];
+  for (let i = 1; i < numbers.length; i++) {
+    if (numbers[i] > largest) {
+      largest = numbers[i];
+    }
+  }
+  return largest;
 }
 
-/**
- * Determines if a string is a palindrome (reads the same forwards and backwards).
- * Ignore case and spaces.
- *
- * @param text
- * @returns
- */
-export function isPalindrome(text: string): boolean {
-  return false;
-}
 
-/**
- * Calculates the number of days until the next birthday.
- * Assume currentMonth and currentDay represent today's date,
- * and birthMonth and birthDay represent the birthday.
- *
- * @param currentMonth (1-12)
- * @param currentDay (1-31)
- * @param birthMonth (1-12)
- * @param birthDay (1-31)
- * @returns
- */
-export function daysUntilBirthday(
+  export function isPalindrome(text: string): boolean {
+    const cleanText = text.replace(/\s/g, "").toLowerCase();
+  
+    for (let i = 0; i < cleanText.length / 2; i++) {
+      if (cleanText[i] !== cleanText[cleanText.length - 1 - i]) {
+        return false;
+      }
+    }
+    return true;
+  }
+  
+  export function daysUntilBirthday(
   currentMonth: number,
   currentDay: number,
   birthMonth: number,
   birthDay: number
 ): number {
-  return 0;
-}
+  const daysInMonth = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31];
+
+  const dayOfYear = (m: number, d: number): number => {
+    let sum = 0;
+    for (let i = 0; i < m - 1; i++) sum += daysInMonth[i];
+    return sum + d;
+  };
+
+  const cur = dayOfYear(currentMonth, currentDay);
+  const bday = dayOfYear(birthMonth, birthDay);
+
+  if (cur === bday) return 0; // Today is the birthday
+
+  let diff = bday - cur;
+  if (diff < 0) diff += 365; // Birthday is next year
+
+  return diff;
+}