Update .env.test, lesson7.ts, and part_g.ts

Author: JoyBrown252

lesson_07/conditionals/.env.test

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

lesson_07/conditionals/src/lesson7.ts

@@ -12,10 +12,16 @@ export function compareStrings(a: string, b: string): number {
   // if it is greater, and 0 if the strings are equal.
   const distance = computeLexicographicDistance(a, b);
 
-  // TODO(you): Finish this method.
+  if (distance < 0) {
+    return -1
+
+  }
+  if (distance > 0) {
+    return 1
+  }
+
+  return 0
 
-  return 0;
-}
 
 /**
  * Computes the factorial of the given value of `n`.

lesson_07/conditionals/src/part_g.ts

@@ -5,8 +5,17 @@
  * @returns
  */
 export function findLargestNumber(numbers: number[]): number {
-  return 0;
-}
+  let largest = numbers[0];
+
+  // loop through numbers using index
+  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).
@@ -16,7 +25,18 @@ export function findLargestNumber(numbers: number[]): number {
  * @returns
  */
 export function isPalindrome(text: string): boolean {
-  return false;
+  //clean up input text and replace all spaces from the string
+  // change all the uppercase letters to lowercase
+  const clean = text.replace(/\s+/g, "").toLowerCase();
+  // clean = amanaplanacanalpanama
+
+  for (let i = 0; i < clean.length / 2; i++) {
+    if (clean[i] !== clean[clean.length - 1 - i]) {
+      return false;
+    }
+  }
+  return true;
+}
 }
 
 /**
@@ -36,5 +56,5 @@ export function daysUntilBirthday(
   birthMonth: number,
   birthDay: number
 ): number {
-  return 0;
+  throw new Error("Not implemented yet");
 }