Given an integer array nums, return all elements that appear more than ⌊n/3⌋ times.

Key Observation

An element must appear more than n/3 times.

This means there can be at most 2 such elements.

Why?