Added tests 49-74

Author: ThanhNIT

src/main/python/g0001_0100/s0049_group_anagrams/Solution0049.py

@@ -4,6 +4,7 @@
 # #2025_07_24_Time_11_ms_(82.75%)_Space_20.85_MB_(56.49%)
 
 from collections import defaultdict
+from typing import List
 
 class Solution:
     def groupAnagrams(self, strs: List[str]) -> List[List[str]]:

src/main/python/g0001_0100/s0049_group_anagrams/Solution0049_test.py

@@ -0,0 +1,21 @@
+import unittest
+from Solution0049 import Solution
+
+def sort_nested(lists):
+    return sorted([sorted(x) for x in lists])
+
+class SolutionTest(unittest.TestCase):
+    def test_groupAnagrams(self):
+        res = Solution().groupAnagrams(["eat","tea","tan","ate","nat","bat"])
+        expected = [["bat"],["nat","tan"],["ate","eat","tea"]]
+        self.assertEqual(sort_nested(res), sort_nested(expected))
+
+    def test_groupAnagrams2(self):
+        res = Solution().groupAnagrams([""])
+        expected = [[""]]
+        self.assertEqual(sort_nested(res), sort_nested(expected))
+
+    def test_groupAnagrams3(self):
+        res = Solution().groupAnagrams(["a"])
+        expected = [["a"]]
+        self.assertEqual(sort_nested(res), sort_nested(expected))

src/main/python/g0001_0100/s0051_n_queens/Solution0051.py

@@ -1,6 +1,8 @@
 # #Hard #Top_100_Liked_Questions #Array #Backtracking #Big_O_Time_O(N!)_Space_O(N)
 # #2025_07_24_Time_6_ms_(98.12%)_Space_18.42_MB_(15.31%)
 
+from typing import List
+
 class Solution:
     def solveNQueens(self, n: int) -> List[List[str]]:
         pos = [False] * (n + 2 * n - 1 + 2 * n - 1)
@@ -26,7 +28,7 @@ def helper(self, n: int, row: int, pos: List[bool], pos2: List[int], ans: List[L
             pos[n + i + row] = False
             pos[index] = False
 
-    def construct(self, n: int, pos: list[int], ans: list[list[str]]):
+    def construct(self, n: int, pos: List[int], ans: List[List[str]]):
         sol = []
         for r in range(n):
             queenRow = ['.'] * n

src/main/python/g0001_0100/s0051_n_queens/Solution0051_test.py

@@ -0,0 +1,16 @@
+import unittest
+from Solution0051 import Solution
+
+def sort_nested(lists):
+    return sorted(lists)
+
+class SolutionTest(unittest.TestCase):
+    def test_solveNQueens(self):
+        res = Solution().solveNQueens(4)
+        expected = [[".Q..","...Q","Q...","..Q."],["..Q.","Q...","...Q",".Q.."]]
+        self.assertEqual(sort_nested(res), sort_nested(expected))
+
+    def test_solveNQueens2(self):
+        res = Solution().solveNQueens(1)
+        expected = [["Q"]]
+        self.assertEqual(sort_nested(res), sort_nested(expected))

src/main/python/g0001_0100/s0053_maximum_subarray/Solution0053.py

@@ -3,6 +3,8 @@
 # #Udemy_Famous_Algorithm #Top_Interview_150_Kadane's_Algorithm #Big_O_Time_O(n)_Space_O(1)
 # #2025_07_24_Time_50_ms_(77.23%)_Space_32.78_MB_(39.19%)
 
+from typing import List
+
 class Solution:
     def maxSubArray(self, nums: List[int]) -> int:
         maxi = float('-inf')

src/main/python/g0001_0100/s0053_maximum_subarray/Solution0053_test.py

@@ -0,0 +1,12 @@
+import unittest
+from Solution0053 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_maxSubArray(self):
+        self.assertEqual(Solution().maxSubArray([-2,1,-3,4,-1,2,1,-5,4]), 6)
+
+    def test_maxSubArray2(self):
+        self.assertEqual(Solution().maxSubArray([1]), 1)
+
+    def test_maxSubArray3(self):
+        self.assertEqual(Solution().maxSubArray([5,4,-1,7,8]), 23)

src/main/python/g0001_0100/s0055_jump_game/Solution0055.py

@@ -3,6 +3,8 @@
 # #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
 # #2025_07_24_Time_12_ms_(85.38%)_Space_18.61_MB_(41.98%)
 
+from typing import List
+
 class Solution:
     def canJump(self, nums: List[int]) -> bool:
         goal = len(nums) - 1

src/main/python/g0001_0100/s0055_jump_game/Solution0055_test.py

@@ -0,0 +1,12 @@
+import unittest
+from Solution0055 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_canJump(self):
+        self.assertTrue(Solution().canJump([2,3,1,1,4]))
+
+    def test_canJump2(self):
+        self.assertFalse(Solution().canJump([3,2,1,0,4]))
+
+    def test_canJump3(self):
+        self.assertTrue(Solution().canJump([1]))

src/main/python/g0001_0100/s0056_merge_intervals/Solution0056.py

@@ -3,6 +3,8 @@
 # #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n)
 # #2025_07_24_Time_7_ms_(72.98%)_Space_20.89_MB_(89.16%)
 
+from typing import List
+
 class Solution:
     def merge(self, intervals: List[List[int]]) -> List[List[int]]:
         intervals.sort(key=lambda x: x[0])

src/main/python/g0001_0100/s0056_merge_intervals/Solution0056_test.py

@@ -0,0 +1,18 @@
+import unittest
+from Solution0056 import Solution
+
+class SolutionTest(unittest.TestCase):
+    def test_merge(self):
+        res = Solution().merge([[1,3],[2,6],[8,10],[15,18]])
+        expected = [[1,6],[8,10],[15,18]]
+        self.assertEqual(res, expected)
+
+    def test_merge2(self):
+        res = Solution().merge([[1,4],[4,5]])
+        expected = [[1,5]]
+        self.assertEqual(res, expected)
+
+    def test_merge3(self):
+        res = Solution().merge([[1,4],[0,4]])
+        expected = [[0,4]]
+        self.assertEqual(res, expected)