Added tests 75-102

Author: ThanhNIT

src/main/python/g0001_0100/s0075_sort_colors/Solution0075.py

@@ -2,6 +2,8 @@
 # #Data_Structure_II_Day_2_Array #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1)
 # #2025_07_24_Time_0_ms_(100.00%)_Space_17.89_MB_(33.05%)
 
+from typing import List
+
 class Solution:
     def sortColors(self, nums: List[int]) -> None:
         """

src/main/python/g0001_0100/s0075_sort_colors/Solution0075_test.py

@@ -0,0 +1,18 @@
+import unittest
+from Solution0075 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_sortColors(self):
+        nums = [2,0,2,1,1,0]
+        Solution().sortColors(nums)
+        self.assertEqual(nums, [0,0,1,1,2,2])
+
+    def test_sortColors2(self):
+        nums = [2,0,1]
+        Solution().sortColors(nums)
+        self.assertEqual(nums, [0,1,2])
+
+    def test_sortColors3(self):
+        nums = [0]
+        Solution().sortColors(nums)
+        self.assertEqual(nums, [0])

src/main/python/g0001_0100/s0076_minimum_window_substring/Solution0076_test.py

@@ -0,0 +1,12 @@
+import unittest
+from Solution0076 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_minWindow(self):
+        self.assertEqual(Solution().minWindow("ADOBECODEBANC", "ABC"), "BANC")
+
+    def test_minWindow2(self):
+        self.assertEqual(Solution().minWindow("a", "a"), "a")
+
+    def test_minWindow3(self):
+        self.assertEqual(Solution().minWindow("a", "aa"), "")

src/main/python/g0001_0100/s0078_subsets/Solution0078.py

@@ -3,6 +3,7 @@
 # #Big_O_Time_O(2^n)_Space_O(n*2^n) #2025_07_24_Time_0_ms_(100.00%)_Space_18.05_MB_(21.18%)
 
 from itertools import combinations
+from typing import List
 
 class Solution:
     def subsets(self, nums: List[int]) -> List[List[int]]:

src/main/python/g0001_0100/s0078_subsets/Solution0078_test.py

@@ -0,0 +1,16 @@
+import unittest
+from Solution0078 import Solution
+
+def sort_nested(lists):
+    return sorted([sorted(x) for x in lists])
+
+class SolutionTest(unittest.TestCase):
+    def test_subsets(self):
+        res = Solution().subsets([1,2,3])
+        expected = [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]
+        self.assertEqual(sort_nested(res), sort_nested(expected))
+
+    def test_subsets2(self):
+        res = Solution().subsets([0])
+        expected = [[],[0]]
+        self.assertEqual(sort_nested(res), sort_nested(expected))

src/main/python/g0001_0100/s0079_word_search/Solution0079.py

@@ -2,6 +2,9 @@
 # #Algorithm_II_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking
 # #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2025_07_24_Time_623_ms_(94.85%)_Space_17.84_MB_(65.07%)
 
+from typing import List
+from collections import Counter
+
 class Solution:
     def exist(self, board: List[List[str]], word: str) -> bool:
         n = len(board)
@@ -15,7 +18,8 @@ def is_sub(board, word):
             c = Counter()
             for line in board:
                 c.update(line)
-            return Counter(word) <= c
+            w = Counter(word)
+            return all(c[ch] >= count for ch, count in w.items())
 
         if not is_sub(board, word):
             return False

src/main/python/g0001_0100/s0079_word_search/Solution0079_test.py

@@ -0,0 +1,15 @@
+import unittest
+from Solution0079 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_exist(self):
+        board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]]
+        self.assertTrue(Solution().exist(board, "ABCCED"))
+
+    def test_exist2(self):
+        board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]]
+        self.assertTrue(Solution().exist(board, "SEE"))
+
+    def test_exist3(self):
+        board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]]
+        self.assertFalse(Solution().exist(board, "ABCB"))

src/main/python/g0001_0100/s0084_largest_rectangle_in_histogram/Solution0084.py

@@ -1,6 +1,8 @@
 # #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Stack #Monotonic_Stack
 # #Big_O_Time_O(n_log_n)_Space_O(log_n) #2025_07_24_Time_63_ms_(99.53%)_Space_29.12_MB_(95.20%)
 
+from typing import List
+
 class Solution:
     def largestRectangleArea(self, heights: List[int]) -> int:
         lefts = [0]

src/main/python/g0001_0100/s0084_largest_rectangle_in_histogram/Solution0084_test.py

@@ -0,0 +1,12 @@
+import unittest
+from Solution0084 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_largestRectangleArea(self):
+        self.assertEqual(Solution().largestRectangleArea([2,1,5,6,2,3]), 10)
+
+    def test_largestRectangleArea2(self):
+        self.assertEqual(Solution().largestRectangleArea([2,4]), 4)
+
+    def test_largestRectangleArea3(self):
+        self.assertEqual(Solution().largestRectangleArea([1]), 1)

src/main/python/g0001_0100/s0094_binary_tree_inorder_traversal/Solution0094.py

@@ -2,6 +2,14 @@
 # #Stack #Data_Structure_I_Day_10_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n)
 # #2025_07_24_Time_0_ms_(100.00%)_Space_17.90_MB_(12.04%)
 
+from typing import Optional, List
+
+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, val=0, left=None, right=None):