feat: adds Java and TypeScript Implementation

Author: TatsuyaRyujin

lesson_12/structs_java/structs_app/src/main/java/com/codedifferently/lesson12/Lesson12.java

@@ -7,6 +7,28 @@ public class Lesson12 {
    * https://github.com/yang-su2000/Leetcode-algorithm-practice/tree/master/3062-winner-of-the-linked-list-game
    */
   public String gameResult(ListNode head) {
-    return null;
+    int evenScore = 0, oddScore = 0;
+    ListNode curr = head;
+
+    while (curr != null) {
+      int evenVal = curr.val;
+      int oddVal = curr.next.val;
+
+      if (evenVal > oddVal) {
+        evenScore++;
+      } else {
+        oddScore++;
+      }
+
+      curr = curr.next.next;
+    }
+
+    if (evenScore > oddScore) {
+      return "Even";
+    } else if (oddScore > evenScore) {
+      return "Odd";
+    } else {
+      return "Tie";
+    }
   }
 }

lesson_12/structs_java/structs_app/src/main/java/com/codedifferently/lesson12/Stack.java

@@ -10,17 +10,25 @@ public Stack() {
 
   public void push(int value) {
     // Your code here
+    ListNode newNode = new ListNode(value);
+    newNode.next = top;
+    top = newNode;
   }
 
   public int pop() {
-    return 0;
+    int val = top.val;
+    top = top.next;
+    return val;
   }
 
   public int peek() {
-    return 0;
+    if (isEmpty()) {
+      throw new IllegalStateException("Empty List");
+    }
+    return top.val;
   }
 
   public boolean isEmpty() {
-    return true;
+    return top == null;
   }
 }

lesson_12/structs_ts/src/lesson12.ts

@@ -6,6 +6,27 @@ 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 '';
+    let evenScore = 0,
+      oddScore = 0;
+    let curr = head;
+
+    while (curr !== null && curr.next !== undefined) {
+      const evenVal = curr.val;
+      const oddVal = curr.next.val;
+
+      if (evenVal > oddVal) {
+        evenScore++;
+      } else {
+        oddScore++;
+      }
+
+      curr = curr.next?.next ?? null;
+    }
+    if (evenScore > oddScore) {
+      return 'Even';
+    } else if (oddScore > evenScore) {
+      return 'Odd';
+    }
+    return 'Tie';
   }
 }

lesson_12/structs_ts/src/stack.ts

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