Adaptive Telemetry Poll Scheduling | Dataford Interview Questions

Given a list of telemetry urgency scores urgency, an integer max_polls, and an integer cooldown, compute a polling schedule that minimizes battery usage while still polling the most important moments. Return the selected poll indices in increasing order. After polling at index i, the next cooldown indices cannot be polled.

Constraints

1 <= len(urgency) <= 10^5
0 <= urgency[i] <= 10^9
1 <= max_polls <= len(urgency)
0 <= cooldown < len(urgency)

Function Signature

def schedule_polls(urgency, max_polls, cooldown):

Your question is Adaptive Telemetry Poll Scheduling. 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

Constraints

1 <= len(urgency) <= 10^5
0 <= urgency[i] <= 10^9
1 <= max_polls <= len(urgency)
0 <= cooldown < len(urgency)

Function Signature

def schedule_polls(urgency, max_polls, cooldown):

Your question is Adaptive Telemetry Poll Scheduling. 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.