codejump
HardPro challengeJavaScriptTypeScript

Priority Update Scheduler

ReactSchedulingData Structures

Implement a min-heap-based scheduler. Each task: { id, priority }.
Lower priority number = higher priority. Process in priority order;
break ties by insertion order.

solve(tasks) returns processing order.

Sample tests

Test #1Mixed priorities
Input: [[{"id":"a","priority":2},{"id":"b","priority":1},{"id":"c","priority":3}]]
Output: ["b","a","c"]
Test #2Tie → insertion order
Input: [[{"id":"x","priority":1},{"id":"y","priority":1}]]
Output: ["x","y"]
Test #3Empty
Input: [[]]
Output: []
Test #4Two ties
Input: [[{"id":"a","priority":5},{"id":"b","priority":1},{"id":"c","priority":5}]]
Output: ["b","a","c"]
Test #5Single task
Input: [[{"id":"only","priority":99}]]
Output: ["only"]
← All challenges