Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 697 with 40 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 697 # by problem number
lcpy gen -s degree_of_an_array # by problem name
nums, the degree of this array is defined as the maximum frequency of any one of its elements.
Your task is to find the smallest possible length of a (contiguous) subarray of nums, that has the same degree as nums.
Input: nums = [1,2,2,3,1]
Output: 2
Explanation:
The input array has a degree of 2 because both elements 1 and 2 appear twice.
Of the subarrays that have the same degree:
[1, 2, 2, 3, 1], [1, 2, 2, 3], [2, 2, 3, 1], [1, 2, 2], [2, 2, 3], [2, 2]
The shortest length is 2. So return 2.
Input: nums = [1,2,2,3,1,4,2]
Output: 6
Explanation:
The degree is 3 because the element 2 is repeated 3 times.
So [2,2,3,1,4,2] is the shortest subarray, therefore returning 6.
class Solution:
# Time: O(n)
# Space: O(n)
def find_shortest_sub_array(self, nums: list[int]) -> int:
first: dict[int, int] = {}
last: dict[int, int] = {}
count: dict[int, int] = {}
for i, num in enumerate(nums):
if num not in first:
first[num] = i
last[num] = i
count[num] = count.get(num, 0) + 1
degree = max(count.values())
return min(last[num] - first[num] + 1 for num in count if count[num] == degree)
| Time | Space |
|---|---|
| O(n) | O(n) |