InterviewDB Question

Good Game Score Threshold: Find Minimum Score Cutoff Where Most Players Pass

Question Details

Problem You are given a list of player scores and a fraction f (0 < f <= 1.0). Find the minimum integer threshold t such that at least ceil(f * n) players have a score >= t. Return -1 if no valid threshold exists. Example: Follow-ups How would you solve this with binary search? What is the predicate? What is the time complexity with and without sorting? What if scores are streamed in and you need to update the threshold after each new score? Extend to multiple game modes: each mode has its own s…

Full Details

🔒

Unlock all Roblox questions

Full insider details, leaked discussions, and candidate experiences.

or every company, $100/year →

About This Question

This is a reported interview question from a roblox interview during the phone round.

It covers the following topics: Coding, Phone, Onsite, Binary Search .