[WHYjun] WEEK 01 solutions - (3/5)

WHYjun · WHYjun · commit 8b97e4219ed7 · 2025-11-08T13:56:59.000-08:00
diff --git a/top-k-frequent-elements/WHYjun.py b/top-k-frequent-elements/WHYjun.py
@@ -1,8 +1,8 @@
 class Solution:
     def topKFrequent(self, nums: List[int], k: int) -> List[int]:
-        # Time complexity: O(nlogn)
+        # Time complexity: O(nlog(n))
         # Space Complexity: O(n)
-        
+
         if len(nums) <= k:
             return list(set(nums))
 
