Top Algorithm Interview Questions Fully Explained: Find the Majority Element in a list
The majority element is the element that appears more than ⌊n / 2⌋ times and we are going to find it. First I'll show you what the "You failed!" answer would be, then will write a sane rational one using HashMaps. I will use Rust to write this for fun.. and also to let you write your own in Python. At last we will finish with a cool, somehow non-obvious method called "voting algorithm".
00:00 - Understanding the Majority element question
04:00 - Describing the HashMap (Dict) based solution
08:48 - Majority Element solution in Rust
14:15 - Voting solution for majority element
On leetcode: https://leetcode.com/problems/majorit...