Available question text
Variation of the subset sum problem
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
- Two Sum problem with hash map
Other questions
- a medium level dp problem
Other questions
- a problem about graph and bfs
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.
Glassdoor · 1 record
Netflix
Variation of the subset sum problem
Reported date not specified · 1 source report
Software Engineer
Source snapshot: Nov 12, 2026
View source