Concurrent Job / Task Scheduler

Problem Overview

Implement a concurrent task/job scheduler with multiple workers. The scheduler must accept submitted jobs, dispatch them to available workers, and coordinate concurrent execution — with the required property that every job runs exactly once: none processed twice, none dropped. One observed variant instead emphasises an LFU (Least Frequently Used) scheduling/eviction…

• 3 candidate-reported follow-ups — the exact probes interviewers asked, with the trigger for each
• The rest of the problem statement — full requirements, constraints, and edge cases
• Approach and trade-offs — what passing candidates did, and the mistakes that sink people