Schedule Meeting
Reported by candidates from Roblox's online assessment. Pattern, common pitfall, and the honest play if you blank under the timer.
Roblox asked this in September 2024 and it's a classic interval scheduling problem dressed up as a meeting planner. You're given a set of time slots or availability windows, and you need to either find the maximum number of non-overlapping meetings or determine if a specific set of meetings can fit without conflict. The trick is always the same: sort by end time, then greedily pick meetings. If you blank on the greedy choice, StealthCoder will feed you the pattern in real time during the OA.
Pattern and pitfall
The core algorithm is greedy interval selection. Sort all meetings or slots by their end time, then iterate through and pick the next meeting that starts after the previous one ended. This maximizes the count of non-overlapping intervals. The pitfall candidates hit is trying to sort by start time or attempting dynamic programming when the greedy approach is optimal. The array manipulation is minimal, the sorting is the heavy lift, and the traversal is linear. During the live assessment, if you freeze on whether to sort or iterate, StealthCoder sits in your corner as a safety net, confirming the pattern and the code shape.
The honest play: practice the pattern, and have StealthCoder ready for the one you didn't see coming.
You can drill Schedule Meeting cold, or you can hedge it. StealthCoder runs invisibly during screen share and surfaces a working solution in under 2 seconds. The proctor sees the IDE. They don't see what's behind it. Built for the candidate who saw this exact problem leak two days before his OA and wondered if anyone had a play.
Get StealthCoderRelated leaked OAs
You've seen the question.
Make sure you actually pass Roblox's OA.
Roblox reuses patterns across OAs. Built for the candidate who saw this exact problem leak two days before his OA and wondered if anyone had a play. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Schedule Meeting FAQ
Is this actually hard or just a sorting trick?+
It's a sorting trick. Once you see it's interval scheduling, the solution writes itself. The hard part is recognizing the pattern in the first 30 seconds. After that, implementation is 10 minutes of code.
What if the problem asks for the actual meetings, not just the count?+
Same algorithm. Instead of incrementing a counter, store the selected intervals in a result array. When you greedily pick a meeting, append it to the result. Return the list at the end.
Do I need to handle overlapping edge cases like meetings that touch at a boundary?+
Almost always yes. If meeting A ends at time 5 and meeting B starts at time 5, they're typically non-overlapping. Check the problem statement. If unclear, assume they don't conflict.
Can I solve this in 48 hours of prep without prior practice?+
Yes, if you know the greedy interval pattern. If you don't, spend 20 minutes reading about activity selection or interval scheduling on LeetCode. The rest is pattern recognition on test day.
What language did past Roblox candidates use?+
Python, Java, and C++ all appeared. Roblox doesn't restrict. Use whatever you're fastest in. Sorting and arrays work in any language.