229. Majority Element II

LeetCodeArrayHash TableSortingCountingOpen on judge ↗

Given an integer array of size n, find all elements that appear more than &lfloor;n / 3&rfloor; 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?

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI