Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Day 155 #322

Closed
vaskoz opened this issue Jan 24, 2019 · 1 comment
Closed

Day 155 #322

vaskoz opened this issue Jan 24, 2019 · 1 comment
Assignees
@vaskoz

Comments

@vaskoz
Copy link
Owner

vaskoz commented Jan 24, 2019

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 vaskoz self-assigned this Jan 24, 2019
@vaskoz
Copy link
Owner Author

vaskoz commented Jan 25, 2019

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

@vaskoz vaskoz mentioned this issue Jan 25, 2019
Merged
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@vaskoz vaskoz

Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@vaskoz