From f5430bdd0af68292544a72c006c0cd7a76172882 Mon Sep 17 00:00:00 2001
From: Valentyn Kolesnikov <javadev75@gmail.com>
Date: Mon, 7 Apr 2025 09:24:48 +0300
Subject: [PATCH] Improved tasks 97, 103, 106

---
 .../ts/g0001_0100/s0097_interleaving_string/solution.ts   | 4 ++--
 .../solution.ts                                           | 8 +++++++-
 .../solution.test.ts                                      | 2 +-
 3 files changed, 10 insertions(+), 4 deletions(-)

diff --git a/src/main/ts/g0001_0100/s0097_interleaving_string/solution.ts b/src/main/ts/g0001_0100/s0097_interleaving_string/solution.ts
index 4823a72..255f12f 100644
--- a/src/main/ts/g0001_0100/s0097_interleaving_string/solution.ts
+++ b/src/main/ts/g0001_0100/s0097_interleaving_string/solution.ts
@@ -2,7 +2,7 @@
 // #2025_04_05_Time_43_ms_(97.65%)_Space_58.17_MB_(61.77%)
 
 function isInterleave(s1: string, s2: string, s3: string): boolean {
-    if (s3.length !== (s1.length + s2.length)) {
+    if (s3.length !== s1.length + s2.length) {
         return false
     }
     const cache: boolean[][] = Array.from({ length: s1.length + 1 }, () => Array(s2.length + 1).fill(null))
@@ -16,7 +16,7 @@ function isInterleaveHelper(
     i1: number,
     i2: number,
     i3: number,
-    cache: boolean[][]
+    cache: boolean[][],
 ): boolean {
     if (cache[i1][i2] !== null) {
         return cache[i1][i2]
diff --git a/src/main/ts/g0101_0200/s0106_construct_binary_tree_from_inorder_and_postorder_traversal/solution.ts b/src/main/ts/g0101_0200/s0106_construct_binary_tree_from_inorder_and_postorder_traversal/solution.ts
index 5b4a677..8188f36 100644
--- a/src/main/ts/g0101_0200/s0106_construct_binary_tree_from_inorder_and_postorder_traversal/solution.ts
+++ b/src/main/ts/g0101_0200/s0106_construct_binary_tree_from_inorder_and_postorder_traversal/solution.ts
@@ -22,7 +22,13 @@ function buildTree(inorder: number[], postorder: number[]): TreeNode | null {
     return helper(inorder, postorder, inIndex, postIndex, Number.MAX_VALUE)
 }
 
-function helper(inorder: number[], postorder: number[], inIndex: number[], postIndex: number[], target: number): TreeNode | null {
+function helper(
+    inorder: number[],
+    postorder: number[],
+    inIndex: number[],
+    postIndex: number[],
+    target: number,
+): TreeNode | null {
     if (inIndex[0] < 0 || inorder[inIndex[0]] === target) {
         return null
     }
diff --git a/src/test/ts/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/solution.test.ts b/src/test/ts/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/solution.test.ts
index e20585b..96bda40 100644
--- a/src/test/ts/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/solution.test.ts
+++ b/src/test/ts/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/solution.test.ts
@@ -4,7 +4,7 @@ import { expect, test } from 'vitest'
 import { createTreeNode } from 'src/main/ts/com_github_leetcode/treenode'
 
 test('zigzagLevelOrder', () => {
-    expect(zigzagLevelOrder(createTreeNode([3, 9, 20, null, null, 15, 7]))).toEqual([[3],[20, 9],[15, 7]])
+    expect(zigzagLevelOrder(createTreeNode([3, 9, 20, null, null, 15, 7]))).toEqual([[3], [20, 9], [15, 7]])
 })
 
 test('zigzagLevelOrder2', () => {