Available question text
The source lists this question by title. A full statement is not available in this collection.
Check the source for more detail. You can use the workspace to record questions, notes, and an approach.
Related questions
Continue with questions that share topics or the same question type.
- DP problem: You are given several service options. For each option i, bandwidth[i] is the amount of bandwidth required, and request[i] is the number of requests that can be handled using that bandwidth.
Given a maximum bandwidth limit totalBandwidth, choose a subset of the options so that the total bandwidth used does not exceed totalBandwidth, while the total number of handled requests is as large as possible.
Return the maximum number of requests that can be handled.
Other questions
- Given a graph as an adjacency list that represents a single ring, return all the nodes in the order they appear on the ring, starting from any node and going in either direction.
Other questions
- OOP app that has each stage build on the last. so you need to do refactors and design carefully.
Other questions
- You have one huge file coming in over a constrained link. How do you distribute it to thousands of machines?
Other questions
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Aced · 1 record
Anthropic
Design a peer-to-peer file distribution system that spreads a 10GB file from a single bandwidth-constrained source to thousands of interconnected hosts, each with limited input/output bandwidth, until every machine has the file.
Source date: a year ago
Source snapshot: Nov 12, 2026