The Number of Full Rounds You Have Played — LeetCode 1904 Python Solution

MediumMathString
Problem
#1904
Reading time
2 min

The problem

You are participating in an online chess tournament. There is a chess round that starts every 15 minutes.

Example

Input
loginTime = "09:31", logoutTime = "10:14"
Output
1
Explanation
You played one full round from 09:45 to 10:00.

Python solution

Python
class Solution:
    def numberOfRounds(self, loginTime: str, logoutTime: str) -> int:
        def f(s: str) -> int:
            return int(s[:2]) * 60 + int(s[3:])

        a, b = f(loginTime), f(logoutTime)
        if a > b:
            b += 1440
        a, b = (a + 14) // 15, b // 15
        return max(0, b - a)

Complexity

MeasureComplexity
TimeO(1)
SpaceO(1) auxiliary

Pattern: Math and Number Theory

Find the closed form, the invariant, or the modular identity — and skip the loop entirely. LeetCode 1904. The Number of Full Rounds You Have Played 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

Frequently asked questions

How hard is LeetCode 1904. The Number of Full Rounds You Have Played?
LeetCode 1904. The Number of Full Rounds You Have Played is rated Medium on LeetCode.
What is the time complexity of LeetCode 1904. The Number of Full Rounds You Have Played?
The Python solution on this page runs in O(1).
What is the space complexity of LeetCode 1904. The Number of Full Rounds You Have Played?
The Python solution on this page uses O(1) auxiliary space.
What topics does LeetCode 1904. The Number of Full Rounds You Have Played cover?
LeetCode 1904. The Number of Full Rounds You Have Played is tagged Math and String 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.

Get Stealth Interview