🚀

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

03DAYS
:
23HOURS
:
03MINUTES
:
29SECONDS

Leetcode Problem 697. Degree of an Array

697. Degree of an Array

Leetcode Solutions

Finding the Shortest Subarray with the Same Degree

  1. Initialize three dictionaries: left to store the first occurrence index, right to store the last occurrence index, and count to store the frequency of each element.
  2. Iterate over the array, updating left, right, and count for each element.
  3. Determine the degree of the array, which is the maximum value in count.
  4. Iterate over the elements in count that have a frequency equal to the degree.
  5. For each of these elements, calculate the length of the subarray from its first to last occurrence and update the answer with the minimum length found.
  6. Return the minimum length as the answer.
UML Thumbnail

Ask Question

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

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...