Hey Guys! I teach competitive coding questions in Tamil:)
Any suggestions welcome:)
Thanks for watching :D
Follow me on Instagram (@code_chak): https://instagram.com/code_chak?igshi...
Follow me on LinkedIn: / akhilchakravarthy
Problem link: https://leetcode.com/problems/majorit...
Problem Description:
Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.
Follow-up: Could you solve the problem in linear time and in O(1) space?
Example 1:
Input: nums = [3,2,3]
Output: [3]
Example 2:
Input: nums = [1]
Output: [1]
Example 3:
Input: nums = [1,2]
Output: [1,2]