Public brief
Talk-through codingNo local grader
Reported interview periodDec 2025–Jan 2026
Sort Integers with Multiple Workers
Implement an ascending integer sort that divides sufficiently large inputs into chunks, sorts chunks concurrently, and merges the sorted runs.
Practice focusReturn a new list and do not mutate the input. For fewer than 1000 values or a single worker, a direct sort is acceptable. On the large-input path, actually partition the input and dispatch chunk sorts; do not sort the entire list in one call. Cap the worker count to useful work and merge all runs correctly, including duplicates and negative values. The worker count must be a positive integer (not a boolean); reject invalid counts with ValueError before dispatch. Use native worker execution for the concurrent path.…