Practice Water Bottles
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
There are numBottles water bottles that are initially full of water. You can exchange numExchange empty water bottles from the market with one full water bottle. The operation of drinking a full water bottle turns it into an empty bottle. Given the two integers numBottles and numExchange, return the maximum number of water bottles you can drink.
Source: Water Bottles on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
numBottles = 9, numExchange = 3
Output
13
# Example 2
Input
numBottles = 15, numExchange = 4
Output
19
Constraints
1 <= numBottles <= 100
2 <= numExchange <= 100
Related LeetCode Problems
Practice more problems similar to Water Bottles.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.