majority-element-ii

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given an integer array of size <code>n</code>, find all elements that appear more than <code>&lfloor;n / 3&rfloor;</code> times.

&nbsp;
Example 1:

<pre>
Input: nums = [3,2,3]
Output: [3]
</pre>

Example 2:

<pre>
Input: nums = [1]
Output: [1]
</pre>

Example 3:

<pre>
Input: nums = [1,2]
Output: [1,2]
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 5 * 104</code></li>
	<li><code>-109 &lt;= nums[i] &lt;= 109</code></li>
</ul>

&nbsp;
Follow up: Could you solve the problem in linear time and in <code>O(1)</code> space?

majorityElement

Majority Element II

Array

Hash Table

Sorting

Counting

Boyer–Moore Majority Vote Algorithm

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs