Added tests 206-234

Author: ThanhNIT

src/test/ts/g0201_0300/s0206_reverse_linked_list/solution.test.ts

@@ -0,0 +1,23 @@
+// tslint:disable:no-magic-numbers
+import { ListNode } from 'src/main/ts/com_github_leetcode/listnode'
+import { reverseList } from 'src/main/ts/g0201_0300/s0206_reverse_linked_list/solution'
+import { expect, test } from 'vitest'
+
+test('reverseList', () => {
+    const headActual = new ListNode(1)
+    headActual.next = new ListNode(2)
+    headActual.next.next = new ListNode(3)
+    headActual.next.next.next = new ListNode(4)
+    headActual.next.next.next.next = new ListNode(5)
+    expect(reverseList(headActual)?.toString()).toEqual('5, 4, 3, 2, 1')
+})
+
+test('reverseList2', () => {
+    const headActual = new ListNode(1)
+    headActual.next = new ListNode(2)
+    expect(reverseList(headActual)?.toString()).toEqual('2, 1')
+})
+
+test('reverseList3', () => {
+    expect(reverseList(null)).toEqual(null)
+})

src/test/ts/g0201_0300/s0207_course_schedule/solution.test.ts

@@ -0,0 +1,16 @@
+// tslint:disable:no-magic-numbers
+import { canFinish } from 'src/main/ts/g0201_0300/s0207_course_schedule/solution'
+import { expect, test } from 'vitest'
+
+test('canFinish', () => {
+    expect(canFinish(2, [[1, 0]])).toEqual(true)
+})
+
+test('canFinish2', () => {
+    expect(
+        canFinish(2, [
+            [1, 0],
+            [0, 1],
+        ]),
+    ).toEqual(false)
+})

src/test/ts/g0201_0300/s0208_implement_trie_prefix_tree/solution.test.ts

@@ -0,0 +1,13 @@
+// tslint:disable:no-magic-numbers
+import { Trie } from 'src/main/ts/g0201_0300/s0208_implement_trie_prefix_tree/solution'
+import { expect, test } from 'vitest'
+
+test('trie', () => {
+    const trie = new Trie()
+    trie.insert('apple')
+    expect(trie.search('apple')).toEqual(true)
+    expect(trie.search('app')).toEqual(false)
+    expect(trie.startsWith('app')).toEqual(true)
+    trie.insert('app')
+    expect(trie.search('app')).toEqual(true)
+})

src/test/ts/g0201_0300/s0215_kth_largest_element_in_an_array/solution.test.ts

@@ -0,0 +1,11 @@
+// tslint:disable:no-magic-numbers
+import { findKthLargest } from 'src/main/ts/g0201_0300/s0215_kth_largest_element_in_an_array/solution'
+import { expect, test } from 'vitest'
+
+test('findKthLargest', () => {
+    expect(findKthLargest([3, 2, 1, 5, 6, 4], 2)).toEqual(5)
+})
+
+test('findKthLargest2', () => {
+    expect(findKthLargest([3, 2, 3, 1, 2, 4, 5, 5, 6], 4)).toEqual(4)
+})

src/test/ts/g0201_0300/s0221_maximal_square/solution.test.ts

@@ -0,0 +1,26 @@
+// tslint:disable:no-magic-numbers
+import { maximalSquare } from 'src/main/ts/g0201_0300/s0221_maximal_square/solution'
+import { expect, test } from 'vitest'
+
+test('maximalSquare', () => {
+    const matrix = [
+        ['1', '0', '1', '0', '0'],
+        ['1', '0', '1', '1', '1'],
+        ['1', '1', '1', '1', '1'],
+        ['1', '0', '0', '1', '0'],
+    ]
+    expect(maximalSquare(matrix)).toEqual(4)
+})
+
+test('maximalSquare2', () => {
+    const matrix = [
+        ['0', '1'],
+        ['1', '0'],
+    ]
+    expect(maximalSquare(matrix)).toEqual(1)
+})
+
+test('maximalSquare3', () => {
+    const matrix = [['0']]
+    expect(maximalSquare(matrix)).toEqual(0)
+})

src/test/ts/g0201_0300/s0226_invert_binary_tree/solution.test.ts

@@ -0,0 +1,19 @@
+// tslint:disable:no-magic-numbers
+import { createTreeNode } from 'src/main/ts/com_github_leetcode/treenode'
+import { invertTree } from 'src/main/ts/g0201_0300/s0226_invert_binary_tree/solution'
+import { expect, test } from 'vitest'
+
+test('invertTree', () => {
+    const tree = createTreeNode([4, 2, 7, 1, 3, 6, 9])
+    expect(invertTree(tree)).toEqual(createTreeNode([4, 7, 2, 9, 6, 3, 1]))
+})
+
+test('invertTree2', () => {
+    const tree = createTreeNode([2, 1, 3])
+    expect(invertTree(tree)).toEqual(createTreeNode([2, 3, 1]))
+})
+
+test('invertTree3', () => {
+    const tree = createTreeNode([])
+    expect(invertTree(tree)).toEqual(createTreeNode([]))
+})

src/test/ts/g0201_0300/s0234_palindrome_linked_list/solution.test.ts

@@ -0,0 +1,18 @@
+// tslint:disable:no-magic-numbers
+import { ListNode } from 'src/main/ts/com_github_leetcode/listnode'
+import { isPalindrome } from 'src/main/ts/g0201_0300/s0234_palindrome_linked_list/solution'
+import { expect, test } from 'vitest'
+
+test('isPalindrome', () => {
+    const headActual = new ListNode(1)
+    headActual.next = new ListNode(2)
+    headActual.next.next = new ListNode(2)
+    headActual.next.next.next = new ListNode(1)
+    expect(isPalindrome(headActual)).toEqual(true)
+})
+
+test('isPalindrome2', () => {
+    const headActual = new ListNode(1)
+    headActual.next = new ListNode(2)
+    expect(isPalindrome(headActual)).toEqual(false)
+})