feat: implement gameResult method and complete Stack operations in TypeScript

Author: Dlafferty251

lesson_12/structs_ts/src/lesson12.ts

@@ -6,6 +6,25 @@ export class Lesson12 {
    * https://github.com/yang-su2000/Leetcode-algorithm-practice/tree/master/3062-winner-of-the-linked-list-game
    */
   public gameResult(head: ListNode | null): string {
-    return '';
+    const scoreBoard = [0, 0];
+
+    while (head?.next != null) {
+      if(head?.val != head?.next?.val && head?.val % 2 == 0) {
+        if(head?.val > head?.next.val) {
+          scoreBoard[head?.val % 2] += 1;
+        } else {
+          scoreBoard[head?.next.val % 2] +=1;
+        }
+      }
+      head = head?.next;
+    }
+
+    if (scoreBoard[0] == scoreBoard[1]) {
+      return 'Tie';
+    } else if (scoreBoard[0] > scoreBoard[1]) {
+      return 'Even';
+    } else {
+      return 'Odd';
+    }
   }
 }

lesson_12/structs_ts/src/stack.ts

@@ -8,18 +8,27 @@ export class Stack {
   }
 
   push(value: number): void {
-    throw new Error('Not implemented');
+    const newNode = new ListNode(value);
+    newNode.next = this.top;
+    this.top = newNode;
   }
 
   pop(): number | undefined {
-    throw new Error('Not implemented');
+    const current = this.top;
+    
+    this.top = this.top?.next;
+    
+    return current?.val;
   }
 
   peek(): number | null {
-    throw new Error('Not implemented');
+    if (this.top === undefined) {
+      throw new Error('Invalid Sytanx');
+    }
+    return this.top.val;
   }
 
   isEmpty(): boolean {
-    throw new Error('Not implemented');
+    return this.top == null;
   }
 }