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

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

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

<p><strong class="example">Example 2:</strong></p>

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

<p><strong class="example">Example 3:</strong></p>

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

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 5 * 10<sup>4</sup></code></li>
	<li><code>-10<sup>9</sup> &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
</ul>

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

class Solution {
public:
    vector<int> majorityElement(vector<int>& nums) {
        int lim=nums.size()/3;int mi=0;vector<int>ans;
        unordered_set<int>st;
        nums.push_back(INT_MAX);
        sort(nums.begin(),nums.end());
        for(int i=0;i<nums.size()-1;i++){
            
            if(nums[i]==nums[i+1]){mi++;if(mi>=lim and st.find(nums[i])==st.end()){ans.push_back(nums[i]);st.insert(nums[i]);}}
            else{mi=0;}
            if(mi>=lim and st.find(nums[i])==st.end()){ans.push_back(nums[i]);st.insert(nums[i]);}
        }
        return ans;

    }
};
19200