Added tests 32-48

Author: ThanhNIT

src/main/python/g0001_0100/s0032_longest_valid_parentheses/Solution0032_test.py

@@ -0,0 +1,9 @@
+import unittest
+from Solution0032 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_longestValidParentheses(self):
+        self.assertEqual(Solution().longestValidParentheses("(()"), 2)
+
+    def test_longestValidParentheses2(self):
+        self.assertEqual(Solution().longestValidParentheses(")()())"), 4)

src/main/python/g0001_0100/s0033_search_in_rotated_sorted_array/Solution0033.py

@@ -3,6 +3,8 @@
 # #Udemy_Binary_Search #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1)
 # #2025_07_22_Time_0_ms_(100.00%)_Space_18.28_MB_(22.25%)
 
+from typing import List
+
 class Solution:
     def search(self, nums: List[int], target: int) -> int:
         lo, hi = 0, len(nums) - 1

src/main/python/g0001_0100/s0033_search_in_rotated_sorted_array/Solution0033_test.py

@@ -0,0 +1,12 @@
+import unittest
+from Solution0033 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_search(self):
+        self.assertEqual(Solution().search([4,5,6,7,0,1,2], 0), 4)
+
+    def test_search2(self):
+        self.assertEqual(Solution().search([4,5,6,7,0,1,2], 3), -1)
+
+    def test_search3(self):
+        self.assertEqual(Solution().search([1], 0), -1)

src/main/python/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution0034.py

@@ -2,6 +2,8 @@
 # #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Top_Interview_150_Binary_Search
 # #Big_O_Time_O(log_n)_Space_O(1) #2025_07_22_Time_0_ms_(100.00%)_Space_18.99_MB_(75.63%)
 
+from typing import List
+
 class Solution:
     def searchRange(self, nums: List[int], target: int) -> List[int]:
         ans = [-1, -1]

src/main/python/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution0034_test.py

@@ -0,0 +1,12 @@
+import unittest
+from Solution0034 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_searchRange(self):
+        self.assertEqual(Solution().searchRange([5,7,7,8,8,10], 8), [3, 4])
+
+    def test_searchRange2(self):
+        self.assertEqual(Solution().searchRange([5,7,7,8,8,10], 6), [-1, -1])
+
+    def test_searchRange3(self):
+        self.assertEqual(Solution().searchRange([], 0), [-1, -1])

src/main/python/g0001_0100/s0035_search_insert_position/Solution0035.py

@@ -2,6 +2,8 @@
 # #Binary_Search_I_Day_2 #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1)
 # #2025_07_22_Time_0_ms_(100.00%)_Space_18.46_MB_(43.50%)
 
+from typing import List
+
 class Solution:
     def searchInsert(self, nums: List[int], target: int) -> int:
         low = 0

src/main/python/g0001_0100/s0035_search_insert_position/Solution0035_test.py

@@ -0,0 +1,15 @@
+import unittest
+from Solution0035 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_searchInsert(self):
+        self.assertEqual(Solution().searchInsert([1,3,5,6], 5), 2)
+
+    def test_searchInsert2(self):
+        self.assertEqual(Solution().searchInsert([1,3,5,6], 2), 1)
+
+    def test_searchInsert3(self):
+        self.assertEqual(Solution().searchInsert([1,3,5,6], 7), 4)
+
+    def test_searchInsert4(self):
+        self.assertEqual(Solution().searchInsert([1,3,5,6], 0), 0)

src/main/python/g0001_0100/s0039_combination_sum/Solution0039.py

@@ -3,6 +3,8 @@
 # #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n+2^n)
 # #2025_07_22_Time_4_ms_(90.51%)_Space_17.64_MB_(98.10%)
 
+from typing import List
+
 class Solution:
     def combinationSum(self, candidates: List[int], target: int) -> List[List[int]]:
         ans = []

src/main/python/g0001_0100/s0039_combination_sum/Solution0039_test.py

@@ -0,0 +1,18 @@
+import unittest
+from Solution0039 import Solution
+
+def sort_nested(lists):
+    return sorted([sorted(x) for x in lists])
+
+class SolutionTest(unittest.TestCase):
+    def test_combinationSum(self):
+        res = Solution().combinationSum([2,3,6,7], 7)
+        self.assertEqual(sort_nested(res), sort_nested([[7],[2,2,3]]))
+
+    def test_combinationSum2(self):
+        res = Solution().combinationSum([2,3,5], 8)
+        self.assertEqual(sort_nested(res), sort_nested([[2,2,2,2],[2,3,3],[3,5]]))
+
+    def test_combinationSum3(self):
+        res = Solution().combinationSum([2], 1)
+        self.assertEqual(sort_nested(res), sort_nested([]))

src/main/python/g0001_0100/s0041_first_missing_positive/Solution0041.py

@@ -1,6 +1,8 @@
 # #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Udemy_Arrays
 # #Big_O_Time_O(n)_Space_O(n) #2025_07_24_Time_19_ms_(93.81%)_Space_34.68_MB_(19.66%)
 
+from typing import List
+
 class Solution:
     def firstMissingPositive(self, nums: List[int]) -> int:
         counter = 1