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 array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.
You may assume that the array is non-empty and the majority element always exist in the array.
Example 1:
Input: [3,2,3]
Output: 3
Example 2:
Input: [2,2,1,1,1,2,2]
Output: 2