Majority Element II

Problem Statement:

Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.

Example:

Input: nums = [3,2,3]
Output: [3]

Intuition:

Koi algorithm lagegi yaad ni aa rahi

Code:

My Solution

#dsa #some-algo-todo