Improved tasks 21, 51, 55, 76

Author: javadev

src/main/js/g0001_0100/s0021_merge_two_sorted_lists/solution.js

@@ -3,7 +3,7 @@
 // #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(m+n)_Space_O(m+n)
 // #2024_12_04_Time_0_ms_(100.00%)_Space_52.3_MB_(20.64%)
 
-import { ListNode } from "../../com_github_leetcode/listnode";
+import { ListNode } from '../../com_github_leetcode/listnode';
 
 /**
  * Definition for singly-linked list.

src/main/js/g0001_0100/s0076_minimum_window_substring/solution.js

@@ -40,7 +40,7 @@ var minWindow = function(s, t) {
         }
     }
 
-    return d === Number.MAX_VALUE ? "" : s.substring(head, head + d)
+    return d === Number.MAX_VALUE ? '' : s.substring(head, head + d)
 };
 
 export { minWindow }

src/test/js/com_github_leetcode/listnode.test.js

@@ -0,0 +1,58 @@
+// tslint:disable:no-magic-numbers
+import { describe, it, expect } from 'vitest'
+import { ListNode } from 'src/main/js/com_github_leetcode/listnode'
+import { constructLinkedList, createSinglyLinkedList } from 'src/test/js/com_github_leetcode/linkedlistutils'
+
+describe('ListNode', () => {
+    it('should initialize with default values', () => {
+        const node = new ListNode()
+        expect(node.val).toBe(0)
+        expect(node.next).toBeNull()
+    })
+
+    it('should initialize with given values', () => {
+        const nextNode = new ListNode(2)
+        const node = new ListNode(1, nextNode)
+        expect(node.val).toBe(1)
+        expect(node.next).toBe(nextNode)
+    })
+
+    it('toString should return a comma-separated list of values', () => {
+        const node3 = new ListNode(3)
+        const node2 = new ListNode(2, node3)
+        const node1 = new ListNode(1, node2)
+        expect(node1.toString()).toBe('1, 2, 3')
+    })
+})
+
+describe('constructLinkedList', () => {
+    it('should return null for an empty array', () => {
+        expect(constructLinkedList([])).toBeNull()
+    })
+
+    it('should create a linked list from an array', () => {
+        const nums = [1, 2, 3]
+        const list = constructLinkedList(nums)
+        expect(list.val).toBe(1)
+        expect(list.next.val).toBe(2)
+        expect(list.next.next.val).toBe(3)
+        expect(list.next.next.next).toBeNull()
+    })
+})
+
+describe('createSinglyLinkedList', () => {
+    it('should throw an error for an empty array', () => {
+        expect(() => createSinglyLinkedList([])).toThrow(
+            'Please pass in a valid listValues to create a singly linked list.',
+        )
+    })
+
+    it('should create a singly linked list from an array', () => {
+        const listValues = [1, 2, 3]
+        const list = createSinglyLinkedList(listValues)
+        expect(list.val).toBe(1)
+        expect(list.next.val).toBe(2)
+        expect(list.next.next.val).toBe(3)
+        expect(list.next.next.next).toBeNull()
+    })
+})

src/test/js/g0001_0100/s0051_n_queens/solution.test.js

@@ -5,7 +5,7 @@ import { expect, test } from 'vitest'
 test('solveNQueens', () => {
     expect(solveNQueens(4)).toEqual([
         ['..Q.', 'Q...', '...Q', '.Q..'],
-        ['.Q..', '...Q', 'Q...', '..Q.']
+        ['.Q..', '...Q', 'Q...', '..Q.'],
     ])
 })
 

src/test/js/g0001_0100/s0055_jump_game/solution.test.js

@@ -9,3 +9,11 @@ test('canJump', () => {
 test('canJump2', () => {
     expect(canJump([3, 2, 1, 0, 4])).toEqual(false)
 })
+
+test('canJump3', () => {
+    expect(canJump([3])).toEqual(true)
+})
+
+test('canJump4', () => {
+    expect(canJump([0, 3, 1, 1, 4])).toEqual(false)
+})