Available question text
Given three nonnegative cup counts and the rule that each second you may fill either two cups of different types or one cup of any type, compute the minimum seconds to finish; the core challenge is optimally pairing different types (greedy pairing of the largest counts) to maximize two-cup moves and minimize time.
Related questions
Continue with questions that share topics or the same question type.
- Find the Minimum Amount of Time to Brew Potions
Coding
- Minimum Amount of Time to Collect Garbage
Coding
- Amount of Time for Binary Tree to Be Infected
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Find Minimum Time to Finish All Jobs
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2335. Minimum Amount of Time to Fill Cups
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source