Frage im Vorstellungsgespräch bei GreedyGame

Round 1: Telephonic round Basic DS & Algo, Python Round 2: Assignment You have to create multiple APIs, create dockerfile and docker compose and run multiple servers on containers... The APIs will be of two types, one Auctioner and multiple instances of bidders. When auctioner gets a bid, they will send a request to each bidder, and each bidder will in turn reply to the bid with a price. The highest bid wins. The twist was, there was a time limit, and each bidder had a delay. If because of the delay, the bidder doesn't send it's bid within the time limit, auctioner will ignore it. Round 3: F2F interview If I'm given an infinite stream of numbers and a number n, at any given point of time, find: 1) Highest n numbers 2) Average of last n numbers 3) Average of highest n numbers 4) Frequencies of most frequent n numbers. Then, the same question was redirected to a real life scenario, with the auctioner-bidder problem.