EDIT : Big-O

Author: heypaprika

contains-duplicate/heypaprika.py

@@ -1,3 +1,4 @@
+# Big-O 예상 : O(n*k)
 class Solution:
     def containsDuplicate(self, nums: List[int]) -> bool:
         num_dict = {}

house-robber/heypaprika.py

@@ -1,3 +1,4 @@
+# Big-O 예상 : O(n)
 class Solution:
     def rob(self, nums: List[int]) -> int:
         a = [0] * len(nums)

longest-consecutive-sequence/heypaprika.py

@@ -1,3 +1,4 @@
+# Big-O 예상 : O(nlog(n))
 class Solution:
     def longestConsecutive(self, nums: List[int]) -> int:
         nums = sorted(list(set(nums)))

top-k-frequent-elements/heypaprika.py

@@ -1,3 +1,4 @@
+# Big-O 예상 : O(nlog(n))
 import heapq
 class Solution:
     def topKFrequent(self, nums: List[int], k: int) -> List[int]:

valid-palindrome/heypaprika.py

@@ -1,3 +1,4 @@
+# Big-O 예상 : O(n)
 class Solution:
     def isPalindrome(self, s: str) -> bool:
         s = "".join(s.lower().split(" "))