chore: clean up obsolete examples

This commit is contained in:
Prad Nukala committed 2026-09-24 15:32:21 -04:00
1 parent 3445c47ad2
commit 403a2d7f23
18 files changed
+8 -1034

No files matched your search

+6 -5
View File
@@ -9,7 +9,7 @@ Given an integer array nums, return true if any value appears at
least twice in the array, and return false if every element is
distinct.
Example 1:
@@ -37,15 +37,16 @@ Input: nums = [1,1,1,3,3,4,3,2,4,2]
Output: true
Constraints:
• 1 <= nums.length <= 10^5
• 1 <= nums.length <= 10^5
• -10^9 <= nums[i] <= 10^9
• -10^9 <= nums[i] <= 10^9
"""
class Solution:
def containsDuplicate(self, nums: List[int]) -> bool:
return len(set(nums)) != len(nums)