Update Contains Duplicate - Leetcode 217.py

Author: gahogg

Contains Duplicate - Leetcode 217/Contains Duplicate - Leetcode 217.py

@@ -11,6 +11,19 @@ def containsDuplicate(self, nums: List[int]) -> bool:
         # Time Complexity: O(n^2)
         # Space Complexity: O(1)
 
+# Better Brute Force Solution
+class Solution:
+    def containsDuplicate(self, nums: List[int]) -> bool:
+        n = len(nums)
+
+        for i in range(n):
+            for j in range(i+1, n):
+                if nums[i] == nums[j]:
+                    return True
+        return False
+        # Time Complexity: O(n^2)
+        # Space Complexity: O(1)
+
 # Optimal Solution
 class Solution:
     def containsDuplicate(self, nums: list[int]) -> bool: