Compute dasher pay from order event logs

Q: Compute dasher pay from order event logs

This question evaluates datetime parsing, event-stream reconstruction, state-machine reasoning for order lifecycles, and aggregation of timed intervals to compute compensation, including handling unordered timestamps, timezones, rounding, and malformed transitions.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

You are given a list of delivery-order event records for a single dasher. Each record contains:

order_id
event_type in {CREATED, ACCEPTED, PICKED_UP, DELIVERED, CANCELED}
timestamp as a datetime string (may include timezone; events may not be pre-sorted)

Rules:

An order is considered active for pay starting at ACCEPTED and ending at the first of DELIVERED or CANCELED .
The dasher is paid $rate_per_minute for every minute the order is active (rounding rule should be stated and applied consistently, e.g., round down to whole minutes).
Ignore malformed sequences (e.g., DELIVERED without ACCEPTED ) or define a reasonable handling; your solution should be explicit.
Multiple orders can exist; compute total pay across all orders.

Task: Implement a function that parses the datetimes correctly, reconstructs each order’s state transitions, and returns the total pay.

Compute dasher pay from order event logs

Quick Overview

Comments (0)