Algorithm · Affirm · Hard
Problem You are given a list of offers, a sequence of events, and a single processingTime. Your task is to determine, for each user who appears in the events, which offers they can still redeem at the processingTime. Every offer has a defined active window and a per-user cap on the number of redemptions. The input arrays are structured as follows: offers[i] = [offerId, startAt, endAt, userMaxRedemptionCount] events[i] = [userId, timestamp, action, offerId] All numeric fields…
Checking your access…