Quant Interview Questions: Efficient Majority Algorithm

1 Views
Published
Question:
In a vector of length 2n, an element appears at least n+1 times. What is the most efficient algorithm for finding the vector's mode?

Problem page:
https://atypicalquant.net/quant-interview-questions/quant-interview-questions-efficient-majority-algorithm/
------------------

Timecodes
00:00 - Series Intro: Quant Interview Questions
00:02 - Question
00:27 - Obvious Solution
02:35 - Efficient Algorithm
03:40 - Proof of Solution
05:25 - Notes and Acknowledgments
06:05 - Outro

------------------

Original solution representation: https://www.cs.utexas.edu/~moore/best-ideas/mjrty/index.html

------------------

Book recommendations:
Quant Job Interview Questions and Answers (Second Edition) - https://amzn.to/3eVXd9g
Heard on The Street: Quantitative Questions from Wall Street Job Interviews - https://amzn.to/3rgkBkt

------------------

These animations are largely made using manim: https://github.com/3b1b/manim. Special thanks to 3Blue1Brown and the manim community!

------------------

Various social media stuff:
Website: http://www.atypicalquant.net/
Reddit: https://www.reddit.com/u/atypicalquant
BuyMeACoffee: https://www.buymeacoffee.com/atypicalquant

#quant #interviewquestions #manim #efficient #algorithm #mode #programming #faang
#majority #lineartime #janestreet
Category
Job
Be the first to comment