Added tests 198-234

Author: ThanhNIT

src/main/python/g0101_0200/s0198_house_robber/Solution0198.py

@@ -3,6 +3,8 @@
 # #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP
 # #Big_O_Time_O(n)_Space_O(n) #2025_07_25_Time_0_ms_(100.00%)_Space_17.77_MB_(54.18%)
 
+from typing import List
+
 class Solution:
     def rob(self, nums: List[int]) -> int:
         if len(nums) == 0:

src/main/python/g0101_0200/s0198_house_robber/Solution0198_test.py

@@ -0,0 +1,12 @@
+import unittest
+from Solution0198 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_rob(self):
+        self.assertEqual(Solution().rob([1,2,3,1]), 4)
+
+    def test_rob2(self):
+        self.assertEqual(Solution().rob([2,7,9,3,1]), 12)
+
+    def test_rob3(self):
+        self.assertEqual(Solution().rob([]), 0)

src/main/python/g0101_0200/s0200_number_of_islands/Solution0200.py

@@ -5,6 +5,8 @@
 # #Top_Interview_150_Graph_General #Big_O_Time_O(M*N)_Space_O(M*N)
 # #2025_07_25_Time_234_ms_(82.73%)_Space_19.96_MB_(95.69%)
 
+from typing import List
+
 class Solution:
     def numIslands(self, grid: List[List[str]]) -> int:
         def dfs(grid, x, y):

src/main/python/g0101_0200/s0200_number_of_islands/Solution0200_test.py

@@ -0,0 +1,21 @@
+import unittest
+from Solution0200 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_numIslands(self):
+        grid = [
+            ["1","1","1","1","0"],
+            ["1","1","0","1","0"],
+            ["1","1","0","0","0"],
+            ["0","0","0","0","0"]
+        ]
+        self.assertEqual(Solution().numIslands(grid), 1)
+
+    def test_numIslands2(self):
+        grid = [
+            ["1","1","0","0","0"],
+            ["1","1","0","0","0"],
+            ["0","0","1","0","0"],
+            ["0","0","0","1","1"]
+        ]
+        self.assertEqual(Solution().numIslands(grid), 3)

src/main/python/g0201_0300/s0206_reverse_linked_list/Solution0206.py

@@ -3,6 +3,13 @@
 # #Algorithm_I_Day_10_Recursion_Backtracking #Level_1_Day_3_Linked_List #Udemy_Linked_List
 # #Big_O_Time_O(N)_Space_O(1) #2025_07_25_Time_0_ms_(100.00%)_Space_18.75_MB_(37.87%)
 
+from typing import Optional
+
+class ListNode:
+    def __init__(self, val=0, next=None):
+        self.val = val
+        self.next = next
+
 # Definition for singly-linked list.
 # class ListNode:
 #     def __init__(self, val=0, next=None):

src/main/python/g0201_0300/s0206_reverse_linked_list/Solution0206_test.py

@@ -0,0 +1,34 @@
+import unittest
+from Solution0206 import Solution, ListNode
+
+def from_list(values):
+    dummy = ListNode(0)
+    curr = dummy
+    for v in values:
+        curr.next = ListNode(v)
+        curr = curr.next
+    return dummy.next
+
+def to_list(head):
+    result = []
+    curr = head
+    while curr is not None:
+        result.append(curr.val)
+        curr = curr.next
+    return result
+
+class SolutionTest(unittest.TestCase):
+    def test_reverseList(self):
+        head = from_list([1,2,3,4,5])
+        result = Solution().reverseList(head)
+        self.assertEqual(to_list(result), [5,4,3,2,1])
+
+    def test_reverseList2(self):
+        head = from_list([1,2])
+        result = Solution().reverseList(head)
+        self.assertEqual(to_list(result), [2,1])
+
+    def test_reverseList3(self):
+        head = from_list([])
+        result = Solution().reverseList(head)
+        self.assertEqual(to_list(result), [])

src/main/python/g0201_0300/s0207_course_schedule/Solution0207.py

@@ -2,6 +2,8 @@
 # #Breadth_First_Search #Graph #Topological_Sort #Top_Interview_150_Graph_General
 # #Big_O_Time_O(N)_Space_O(N) #2025_07_25_Time_3_ms_(88.23%)_Space_19.05_MB_(73.39%)
 
+from typing import List
+
 class Solution:
     WHITE = 0
     GRAY = 1

src/main/python/g0201_0300/s0207_course_schedule/Solution0207_test.py

@@ -0,0 +1,12 @@
+import unittest
+from Solution0207 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_canFinish(self):
+        self.assertTrue(Solution().canFinish(2, [[1,0]]))
+
+    def test_canFinish2(self):
+        self.assertFalse(Solution().canFinish(2, [[1,0],[0,1]]))
+
+    def test_canFinish3(self):
+        self.assertTrue(Solution().canFinish(1, []))

src/main/python/g0201_0300/s0208_implement_trie_prefix_tree/Trie_test.py

@@ -0,0 +1,12 @@
+import unittest
+from Trie import Trie
+
+class SolutionTest(unittest.TestCase):
+    def test_trie(self):
+        trie = Trie()
+        trie.insert("apple")
+        self.assertTrue(trie.search("apple"))
+        self.assertFalse(trie.search("app"))
+        self.assertTrue(trie.startsWith("app"))
+        trie.insert("app")
+        self.assertTrue(trie.search("app"))

src/main/python/g0201_0300/s0215_kth_largest_element_in_an_array/Solution0215.py

@@ -3,6 +3,8 @@
 # #Data_Structure_II_Day_20_Heap_Priority_Queue #Top_Interview_150_Heap
 # #Big_O_Time_O(n*log(n))_Space_O(log(n)) #2025_07_25_Time_45_ms_(90.46%)_Space_28.73_MB_(45.18%)
 
+from typing import List
+
 class Solution:
     def findKthLargest(self, nums: List[int], k: int) -> int:
         nums.sort()