Preloaded Constraints Tasks Class | Dataford Interview Questions

Coalition Control maintains a preloaded set of security recommendations for each customer. Implement a task manager that always claims the highest-priority active recommendation while supporting additions, priority updates, and cancellations.

Tasks with larger priorities are selected first. When priorities are equal, select the lexicographically smaller task ID. A claim operation removes and returns the selected task. If no active task exists, it returns None.

Formal Specification

Implement run_task_manager(tasks, operations).

tasks is a list of unique two-element lists, [task_id, priority], where task_id is a string and priority is an integer.
operations is a list of operation lists:
- ['add', task_id, priority]
- ['update', task_id, priority]
- ['cancel', task_id]
- ['claim']
Return a list containing the result of each claim operation, in order. Do not include results for other operations.
Inputs follow the validity constraints below.

Constraints

0 <= len(tasks) <= 10^5
1 <= len(operations) <= 2 * 10^5
1 <= len(task_id) <= 40
-10^9 <= priority <= 10^9
Task IDs are unique among active tasks
An update or cancel targets an active task, and add uses an inactive ID
The total number of tasks added is at most 10^5

Function Signature

def run_task_manager(tasks, operations):

Your question is Preloaded Constraints Tasks Class. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem