How hard is LeetCode 1518. Water Bottles?

LeetCode 1518. Water Bottles is rated Easy on LeetCode.

What topics does LeetCode 1518. Water Bottles cover?

LeetCode 1518. Water Bottles is tagged Math and Simulation on LeetCode.

EasyNo. 1518

Water Bottles — LeetCode 1518 Python Solution

Pattern: Math and Number Theory
Topics: Math, Simulation
Reading time: 2 min
Source: leetcode.com

The problem

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.

Example

Input: numBottles = 9, numExchange = 3
Output: 13
Explanation: You can exchange 3 empty bottles to get 1 full water bottle.

Python solution

PythonSolution

class Solution:
    def numWaterBottles(self, numBottles: int, numExchange: int) -> int:
        ans = numBottles
        while numBottles >= numExchange:
            numBottles -= numExchange - 1
            ans += 1
        return ans

Complexity

Time: O(n) or O(1)
Space · auxiliary: O(1)

Pattern: Math and Number Theory

Find the closed form, the invariant, or the modular identity — and skip the loop entirely. LeetCode 1518. Water Bottles is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Math.

The math and number theory guide has the Python template for the pattern and the 485 LeetCode problems that use it.

Related problems
No.	Problem	Difficulty
0043	Multiply Strings	Medium
0258	Add Digits	Easy
0412	Fizz Buzz	Easy
0415	Add Strings	Easy
0537	Complex Number Multiplication	Medium
0592	Fraction Addition and Subtraction	Medium

Frequently asked questions

How hard is LeetCode 1518. Water Bottles?: LeetCode 1518. Water Bottles is rated Easy on LeetCode.
What topics does LeetCode 1518. Water Bottles cover?: LeetCode 1518. Water Bottles is tagged Math and Simulation on LeetCode.

Stuck on problems like this in a live interview?

Stealth Interview is a desktop app for macOS and Windows. It reads the problem off your screen and returns a working solution with a step-by-step explanation and its time and space complexity, invisible to screen sharing.

Download for Mac Download for Windows

Free to download. Check it runs on your machine, then pick a plan.

90%Subscription

python

Please analyze this context and help me answer the question or solve the problem.

Transcript

"Okay, next one. Given a string, return the length of the longest substring that has no repeating characters. Walk me through your approach before you code it."

Technical interview · 45 minsolution.pyShared editor · Python 3Longest substring without repeatsMediumGiven a string s, return the length of the longest contiguous substring in which every character is unique.s = "abcabcbb"
→ 31def length_of_longest_substring(s: str) -> int:2 last_seen = {}3 left = best = 04 for right, ch in enumerate(s):5 if ch in last_seen and last_seen[ch] >= left:

python

def length_of_longest_substring(s: str) -> int:    last_seen = {}                    # char -> index    left = best = 0    for right, ch in enumerate(s):        if ch in last_seen and last_seen[ch] >= left:            left = last_seen[ch] + 1  # jump past it        last_seen[ch] = right        best = max(best, right - left + 1)    return best    last_seen = {}                    # char -> index

Approach

At each index r, the window's left edge is:

left r = max (left r -1, last[s r] + 1)

Time O(n): each character enters and leaves the window once.
Space O(min(n, k)): k is the size of the character set.

Type your message...

GPT-6.1 Terra

Transcribing...

90%Subscription

python

Please analyze this context and help me answer the question or solve the problem.

Transcript

"Okay, next one. Given a string, return the length of the longest substring that has no repeating characters. Walk me through your approach before you code it."

python

def length_of_longest_substring(s: str) -> int:    last_seen = {}                    # char -> index    left = best = 0    for right, ch in enumerate(s):        if ch in last_seen and last_seen[ch] >= left:            left = last_seen[ch] + 1  # jump past it        last_seen[ch] = right        best = max(best, right - left + 1)    return best    last_seen = {}                    # char -> index

Approach

At each index r, the window's left edge is:

left r = max (left r -1, last[s r] + 1)

Time O(n): each character enters and leaves the window once.
Space O(min(n, k)): k is the size of the character set.

Type your message...

GPT-6.1 TerraClear chat

Transcribing...

QuitEscHide+QCapture+PCrop+OSubmit+EnterPress to get answerLeft/Right+Up/Down+

90%Subscription

python

Please analyze this context and help me answer the question or solve the problem.

Transcript

"Okay, next one. Given a string, return the length of the longest substring that has no repeating characters. Walk me through your approach before you code it."

python

def length_of_longest_substring(s: str) -> int:    last_seen = {}                    # char -> index    left = best = 0    for right, ch in enumerate(s):        if ch in last_seen and last_seen[ch] >= left:            left = last_seen[ch] + 1  # jump past it        last_seen[ch] = right        best = max(best, right - left + 1)    return best    last_seen = {}                    # char -> index

Approach

At each index r, the window's left edge is:

left r = max (left r -1, last[s r] + 1)

Time O(n): each character enters and leaves the window once.
Space O(min(n, k)): k is the size of the character set.

Type your message...

GPT-6.1 TerraClear chat

Transcribing...

Primary display

QuitEscHide+QCapture+PCrop+OSubmit+EnterPress to get answerLeft/Right+Up/Down+

The problem

Example

Python solution

Complexity

Pattern: Math and Number Theory

Related problems

Frequently asked questions

Stuck on problems like this in a live interview?

Approach

Approach

Approach