🚀

End of Year Sale: Use Coupon Code END2025 to Get Extra 25% Off.

08DAYS
:
06HOURS
:
04MINUTES
:
16SECONDS

Leetcode Problem 220. Contains Duplicate III

220. Contains Duplicate III

Leetcode Solutions

Approach # (Buckets)

  1. Define a function getBucketID that takes a number and the width of the buckets (valueDiff + 1) and returns the ID of the bucket this number belongs to.
  2. Initialize an empty dictionary buckets to store the numbers categorized by their bucket IDs.
  3. Iterate through the nums array, and for each number: a. Calculate its bucket ID. b. Check if this bucket or adjacent buckets contain a number that satisfies the abs(nums[i] - nums[j]) <= valueDiff condition. c. If such a number is found, return true. d. Add the current number to its corresponding bucket in buckets. e. If the size of the sliding window exceeds indexDiff, remove the oldest number from buckets.
  4. If no pair is found after iterating through all numbers, return false.
UML Thumbnail

Approach # (Naive Linear Search)

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...