OpenGenus/cosmos
Auf GitHub ansehenMin size sub array with the same degree as the original array
Open
#1.784 geöffnet am 17. Okt. 2017
Hacktoberfestadd codenew algorithm
Repository-Metriken
- Stars
- (13.462 Stars)
- PR-Merge-Metriken
- (Keine gemergten PRs in 30 T)
Beschreibung
Given a non-empty array of non-negative integers nums, the degree of this array is defined as the maximum frequency of any one of its elements.
The task is to find the smallest possible length of a (contiguous) subarray of nums, that has the same degree as nums.
For e.g:
Input: [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.
Adding a PR for CPP version for this using unordered_map.