Added tests 236-394

javadev · web-flow · commit 89650e27d7ca · 2025-09-23T09:45:26.000+03:00
diff --git a/src/main/python/g0001_0100/s0006_zigzag_conversion/Solution0006_test.py b/src/main/python/g0001_0100/s0006_zigzag_conversion/Solution0006_test.py
@@ -0,0 +1,9 @@
+import unittest
+from Solution0006 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_convert(self):
+        self.assertEqual(Solution().convert("PAYPALISHIRING", 3), "PAHNAPLSIIGYIR")
+
+    def test_convert2(self):
+        self.assertEqual(Solution().convert("PAYPALISHIRING", 4), "PINALSIGYAHRPI")
diff --git a/src/main/python/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution0236.py b/src/main/python/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution0236.py
@@ -3,6 +3,12 @@
 # #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n)
 # #2025_07_25_Time_41_ms_(97.74%)_Space_22.14_MB_(43.54%)
 
+class TreeNode:
+    def __init__(self, val=0, left=None, right=None):
+        self.val = val
+        self.left = left
+        self.right = right
+
 # Definition for a binary tree node.
 # class TreeNode:
 #     def __init__(self, x):
diff --git a/src/main/python/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution0236_test.py b/src/main/python/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution0236_test.py
@@ -0,0 +1,32 @@
+import unittest
+from Solution0236 import Solution, TreeNode
+
+class SolutionTest(unittest.TestCase):
+    def test_lowestCommonAncestor(self):
+        leftNodeLeftNode = TreeNode(6)
+        leftNodeRightNode = TreeNode(2, TreeNode(7), TreeNode(4))
+        leftNode = TreeNode(5, leftNodeLeftNode, leftNodeRightNode)
+        rightNode = TreeNode(1, TreeNode(0), TreeNode(8))
+        root = TreeNode(3, leftNode, rightNode)
+        self.assertEqual(
+            Solution().lowestCommonAncestor(root, TreeNode(5), TreeNode(1)).val,
+            3
+        )
+
+    def test_lowestCommonAncestor2(self):
+        leftNodeLeftNode = TreeNode(6)
+        leftNodeRightNode = TreeNode(2, TreeNode(7), TreeNode(4))
+        leftNode = TreeNode(5, leftNodeLeftNode, leftNodeRightNode)
+        rightNode = TreeNode(1, TreeNode(0), TreeNode(8))
+        root = TreeNode(3, leftNode, rightNode)
+        self.assertEqual(
+            Solution().lowestCommonAncestor(root, TreeNode(5), TreeNode(4)).val,
+            5
+        )
+
+    def test_lowestCommonAncestor3(self):
+        root = TreeNode(2, TreeNode(1), None)
+        self.assertEqual(
+            Solution().lowestCommonAncestor(root, TreeNode(2), TreeNode(1)).val,
+            2
+        )
diff --git a/src/main/python/g0201_0300/s0238_product_of_array_except_self/Solution0238.py b/src/main/python/g0201_0300/s0238_product_of_array_except_self/Solution0238.py
@@ -2,6 +2,8 @@
 # #Data_Structure_II_Day_5_Array #Udemy_Arrays #Top_Interview_150_Array/String
 # #Big_O_Time_O(n^2)_Space_O(n) #2025_07_25_Time_15_ms_(97.12%)_Space_23.25_MB_(79.77%)
 
+from typing import List
+
 class Solution:
     def productExceptSelf(self, nums: List[int]) -> List[int]:
         product = 1
diff --git a/src/main/python/g0201_0300/s0238_product_of_array_except_self/Solution0238_test.py b/src/main/python/g0201_0300/s0238_product_of_array_except_self/Solution0238_test.py
@@ -0,0 +1,15 @@
+import unittest
+from Solution0238 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_productExceptSelf(self):
+        self.assertEqual(
+            Solution().productExceptSelf([1, 2, 3, 4]),
+            [24, 12, 8, 6]
+        )
+
+    def test_productExceptSelf2(self):
+        self.assertEqual(
+            Solution().productExceptSelf([-1, 1, 0, -3, 3]),
+            [0, 0, 9, 0, 0]
+        )
diff --git a/src/main/python/g0201_0300/s0239_sliding_window_maximum/Solution0239.py b/src/main/python/g0201_0300/s0239_sliding_window_maximum/Solution0239.py
@@ -2,6 +2,9 @@
 # #Monotonic_Queue #Udemy_Arrays #Big_O_Time_O(n*k)_Space_O(n+k)
 # #2025_07_25_Time_152_ms_(81.96%)_Space_30.79_MB_(96.65%)
 
+from typing import List
+from collections import deque
+
 class Solution:
     def maxSlidingWindow(self, nums: List[int], k: int) -> List[int]:
         q = deque()
diff --git a/src/main/python/g0201_0300/s0239_sliding_window_maximum/Solution0239_test.py b/src/main/python/g0201_0300/s0239_sliding_window_maximum/Solution0239_test.py
@@ -0,0 +1,15 @@
+import unittest
+from Solution0239 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_maxSlidingWindow(self):
+        self.assertEqual(
+            Solution().maxSlidingWindow([1, 3, -1, -3, 5, 3, 6, 7], 3),
+            [3, 3, 5, 5, 6, 7]
+        )
+
+    def test_maxSlidingWindow2(self):
+        self.assertEqual(
+            Solution().maxSlidingWindow([1], 1),
+            [1]
+        )
diff --git a/src/main/python/g0201_0300/s0240_search_a_2d_matrix_ii/Solution0240.py b/src/main/python/g0201_0300/s0240_search_a_2d_matrix_ii/Solution0240.py
@@ -2,6 +2,8 @@
 # #Data_Structure_II_Day_4_Array #Binary_Search_II_Day_8 #Big_O_Time_O(n+m)_Space_O(1)
 # #2025_07_25_Time_143_ms_(64.84%)_Space_24.00_MB_(80.86%)
 
+from typing import List
+
 class Solution:
     def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
         if not matrix or not matrix[0]:
diff --git a/src/main/python/g0201_0300/s0240_search_a_2d_matrix_ii/Solution0240_test.py b/src/main/python/g0201_0300/s0240_search_a_2d_matrix_ii/Solution0240_test.py
@@ -0,0 +1,23 @@
+import unittest
+from Solution0240 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_searchMatrix(self):
+        matrix = [
+            [1, 4, 7, 11, 15],
+            [2, 5, 8, 12, 19],
+            [3, 6, 9, 16, 22],
+            [10, 13, 14, 17, 24],
+            [18, 21, 23, 26, 30]
+        ]
+        self.assertEqual(Solution().searchMatrix(matrix, 5), True)
+
+    def test_searchMatrix2(self):
+        matrix = [
+            [1, 4, 7, 11, 15],
+            [2, 5, 8, 12, 19],
+            [3, 6, 9, 16, 22],
+            [10, 13, 14, 17, 24],
+            [18, 21, 23, 26, 30]
+        ]
+        self.assertEqual(Solution().searchMatrix(matrix, 20), False)
diff --git a/src/main/python/g0201_0300/s0283_move_zeroes/Solution0283.py b/src/main/python/g0201_0300/s0283_move_zeroes/Solution0283.py
@@ -2,6 +2,8 @@
 # #Algorithm_I_Day_3_Two_Pointers #Programming_Skills_I_Day_6_Array #Udemy_Arrays
 # #Big_O_Time_O(n)_Space_O(1) #2025_07_25_Time_3_ms_(80.05%)_Space_18.63_MB_(94.75%)
 
+from typing import List
+
 class Solution:
     def moveZeroes(self, nums: List[int]) -> None:
         """
diff --git a/src/main/python/g0201_0300/s0283_move_zeroes/Solution0283_test.py b/src/main/python/g0201_0300/s0283_move_zeroes/Solution0283_test.py
@@ -0,0 +1,13 @@
+import unittest
+from Solution0283 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_moveZeroes(self):
+        array = [0, 1, 0, 3, 12]
+        Solution().moveZeroes(array)
+        self.assertEqual(array, [1, 3, 12, 0, 0])
+
+    def test_moveZeroes2(self):
+        array = [0]
+        Solution().moveZeroes(array)
+        self.assertEqual(array, [0])
diff --git a/src/main/python/g0201_0300/s0287_find_the_duplicate_number/Solution0287.py b/src/main/python/g0201_0300/s0287_find_the_duplicate_number/Solution0287.py
@@ -2,6 +2,8 @@
 # #Binary_Search_II_Day_5 #Big_O_Time_O(n)_Space_O(n)
 # #2025_07_25_Time_16_ms_(96.25%)_Space_30.09_MB_(49.05%)
 
+from typing import List
+
 class Solution:
     def findDuplicate(self, nums: List[int]) -> int:
         arr = [0] * (len(nums) + 1)
diff --git a/src/main/python/g0201_0300/s0287_find_the_duplicate_number/Solution0287_test.py b/src/main/python/g0201_0300/s0287_find_the_duplicate_number/Solution0287_test.py
@@ -0,0 +1,15 @@
+import unittest
+from Solution0287 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_findDuplicate(self):
+        self.assertEqual(Solution().findDuplicate([1, 3, 4, 2, 2]), 2)
+
+    def test_findDuplicate2(self):
+        self.assertEqual(Solution().findDuplicate([3, 1, 3, 4, 2]), 3)
+
+    def test_findDuplicate3(self):
+        self.assertEqual(Solution().findDuplicate([1, 1]), 1)
+
+    def test_findDuplicate4(self):
+        self.assertEqual(Solution().findDuplicate([1, 1, 2]), 1)
diff --git a/src/main/python/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.py b/src/main/python/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.py
@@ -2,6 +2,8 @@
 # #Top_Interview_150_Heap #Big_O_Time_O(n*log_n)_Space_O(n)
 # #2025_07_25_Time_131_ms_(72.46%)_Space_40.10_MB_(17.67%)
 
+from typing import List
+
 import heapq
 
 class MedianFinder:
diff --git a/src/main/python/g0201_0300/s0295_find_median_from_data_stream/MedianFinder_test.py b/src/main/python/g0201_0300/s0295_find_median_from_data_stream/MedianFinder_test.py
@@ -0,0 +1,18 @@
+import unittest
+from MedianFinder import MedianFinder
+
+class MedianFinderTest(unittest.TestCase):
+    def test_medianFinder(self):
+        medianFinder = MedianFinder()
+        medianFinder.addNum(1)
+        medianFinder.addNum(2)
+        self.assertEqual(medianFinder.findMedian(), 1.5)
+        medianFinder.addNum(3)
+        self.assertEqual(medianFinder.findMedian(), 2.0)
+
+    def test_medianFinder2(self):
+        medianFinder = MedianFinder()
+        medianFinder.addNum(1)
+        medianFinder.addNum(3)
+        medianFinder.addNum(-1)
+        self.assertEqual(medianFinder.findMedian(), 1.0)
diff --git a/src/main/python/g0201_0300/s0300_longest_increasing_subsequence/Solution0300.py b/src/main/python/g0201_0300/s0300_longest_increasing_subsequence/Solution0300.py
@@ -3,6 +3,7 @@
 # #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(n*log_n)_Space_O(n)
 # #2025_07_25_Time_11_ms_(78.54%)_Space_18.12_MB_(38.75%)
 
+from typing import List
 import bisect
 
 class Solution:
diff --git a/src/main/python/g0201_0300/s0300_longest_increasing_subsequence/Solution0300_test.py b/src/main/python/g0201_0300/s0300_longest_increasing_subsequence/Solution0300_test.py
@@ -0,0 +1,12 @@
+import unittest
+from Solution0300 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_lengthOfLIS(self):
+        self.assertEqual(Solution().lengthOfLIS([10, 9, 2, 5, 3, 7, 101, 18]), 4)
+
+    def test_lengthOfLIS2(self):
+        self.assertEqual(Solution().lengthOfLIS([0, 1, 0, 3, 2, 3]), 4)
+
+    def test_lengthOfLIS3(self):
+        self.assertEqual(Solution().lengthOfLIS([7, 7, 7, 7, 7, 7, 7]), 1)
diff --git a/src/main/python/g0301_0400/s0322_coin_change/Solution0322.py b/src/main/python/g0301_0400/s0322_coin_change/Solution0322.py
@@ -3,6 +3,8 @@
 # #Level_2_Day_12_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(m*n)_Space_O(amount)
 # #2025_07_25_Time_454_ms_(96.33%)_Space_18.19_MB_(69.69%)
 
+from typing import List
+
 class Solution:
     def coinChange(self, coins: List[int], amount: int) -> int:
         dp = [0] * (amount + 1)
diff --git a/src/main/python/g0301_0400/s0322_coin_change/Solution0322_test.py b/src/main/python/g0301_0400/s0322_coin_change/Solution0322_test.py
@@ -0,0 +1,12 @@
+import unittest
+from Solution0322 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_coinChange(self):
+        self.assertEqual(Solution().coinChange([1, 2, 5], 11), 3)
+
+    def test_coinChange2(self):
+        self.assertEqual(Solution().coinChange([2], 3), -1)
+
+    def test_coinChange3(self):
+        self.assertEqual(Solution().coinChange([1], 0), 0)
diff --git a/src/main/python/g0301_0400/s0338_counting_bits/Solution0338.py b/src/main/python/g0301_0400/s0338_counting_bits/Solution0338.py
@@ -2,6 +2,8 @@
 # #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num)
 # #2025_07_25_Time_3_ms_(94.51%)_Space_18.68_MB_(22.83%)
 
+from typing import List
+
 class Solution:
     def countBits(self, num: int) -> List[int]:
         result = [0] * (num + 1)
diff --git a/src/main/python/g0301_0400/s0338_counting_bits/Solution0338_test.py b/src/main/python/g0301_0400/s0338_counting_bits/Solution0338_test.py
@@ -0,0 +1,9 @@
+import unittest
+from Solution0338 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_countBits(self):
+        self.assertEqual(Solution().countBits(2), [0, 1, 1])
+
+    def test_countBits2(self):
+        self.assertEqual(Solution().countBits(5), [0, 1, 1, 2, 1, 2])
diff --git a/src/main/python/g0301_0400/s0347_top_k_frequent_elements/Solution0347.py b/src/main/python/g0301_0400/s0347_top_k_frequent_elements/Solution0347.py
@@ -2,6 +2,7 @@
 # #Divide_and_Conquer #Quickselect #Bucket_Sort #Data_Structure_II_Day_20_Heap_Priority_Queue
 # #Big_O_Time_O(n*log(n))_Space_O(k) #2025_07_25_Time_4_ms_(69.79%)_Space_21.51_MB_(27.28%)
 
+from typing import List
 import heapq
 from collections import Counter
 
diff --git a/src/main/python/g0301_0400/s0347_top_k_frequent_elements/Solution0347_test.py b/src/main/python/g0301_0400/s0347_top_k_frequent_elements/Solution0347_test.py
@@ -0,0 +1,15 @@
+import unittest
+from Solution0347 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_topKFrequent(self):
+        self.assertEqual(
+            Solution().topKFrequent([1, 1, 1, 2, 2, 3], 2),
+            [1, 2]
+        )
+
+    def test_topKFrequent2(self):
+        self.assertEqual(
+            Solution().topKFrequent([1], 1),
+            [1]
+        )
diff --git a/src/main/python/g0301_0400/s0394_decode_string/Solution0394_test.py b/src/main/python/g0301_0400/s0394_decode_string/Solution0394_test.py
@@ -0,0 +1,15 @@
+import unittest
+from Solution0394 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_decodeString(self):
+        self.assertEqual(Solution().decodeString("3[a]2[bc]"), "aaabcbc")
+
+    def test_decodeString2(self):
+        self.assertEqual(Solution().decodeString("3[a2[c]]"), "accaccacc")
+
+    def test_decodeString3(self):
+        self.assertEqual(Solution().decodeString("2[abc]3[cd]ef"), "abcabccdcdcdef")
+
+    def test_decodeString4(self):
+        self.assertEqual(Solution().decodeString("abc3[cd]xyz"), "abccdcdcdxyz")
