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

You may return the answer in any order.

Note: Could you solve the problem in linear time and in O(1) space?

Constraints:

• $1 <=$ nums.length $<= 5 * 10^4$

• $-10^9 <=$ nums[i] $<= 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.