229. Majority Element II
Problem Statement
Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.
Example 1:
Input: nums = [3,2,3]
Output: [3]Example 2:
Input: nums = [1]
Output: [1]Example 3:
Input: nums = [1,2]
Output: [1,2]
Constraints:
1 <= nums.length <= 5 * 104-109 <= nums[i] <= 109
Follow up: Could you solve the problem in linear time and in O(1) space?
Intuition
Links
https://leetcode.com/problems/majority-element-ii/description/
Video Links
https://www.youtube.com/watch?v=Eua-UrQ_ANo&ab_channel=NeetCodeIO https://www.youtube.com/watch?v=vwZj1K0e9U8&t=1535s&ab_channel=takeUforward
Approach 1:
Approach 2:
Approach 3:
Approach 4:
Similar Problems
Last updated