Day 155

[vaskoz]

Good morning! Here's your coding interview problem for today.

This problem was asked by MongoDB.

Given a list of elements, find the majority element, which appears more than half the time (> floor(len(lst) / 2.0)).

You can assume that such element exists.

For example, given [1, 2, 1, 1, 3, 4, 0], return 1.

[vaskoz]

https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_majority_vote_algorithm