Majority Element II - Practice Coding | SlaveCode
Problems
Scratchpad
Run
Submit
0
0
1
2
3
4
5
6
7
8
9
0
0
1
2
3
4
5
6
7
8
9
:
0
0
1
2
3
4
5
6
7
8
9
0
0
1
2
3
4
5
6
7
8
9
Toggle theme (Current: Custom)
Scratchpad
Run
Submit
Description
Hints
Solutions
229. Majority Element II
Medium
30 Points
Array
Hash Table
Sorting
Counting
Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.
Examples
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?
JAVASCRIPT
Code
Tests
Result
Description
Hints
Solutions
229. Majority Element II
Medium
30 Points
Array
Hash Table
Sorting
Counting
Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.
Examples
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?
JAVASCRIPT
Code
Tests
Result