The Number of Full Rounds You Have Played

Problem

You are participating in an online chess tournament. There is a chess round that starts every 15 minutes. The first round of the day starts at 00:00, and after every 15 minutes, a new round starts.

For example, the second round starts at 00:15, the fourth round starts at 00:45, and the seventh round starts at 01:30.

You are given two strings loginTime and logoutTime where:

loginTime is the time you will login to the game, and
logoutTime is the time you will logout from the game.

If logoutTime is earlier than loginTime, this means you have played from loginTime to midnight and from midnight to logoutTime.

Return the number of full chess rounds you have played in the tournament.

Note: All the given times follow the 24-hour clock. That means the first round of the day starts at 00:00 and the last round of the day starts at 23:45.

Example 1:

Input: loginTime = "09:31", logoutTime = "10:14"
Output: 1
Explanation: You played one full round from 09:45 to 10:00.
You did not play the full round from 09:30 to 09:45 because you logged in at 09:31 after it began.
You did not play the full round from 10:00 to 10:15 because you logged out at 10:14 before it ended.

Example 2:

Input: loginTime = "21:30", logoutTime = "03:00"
Output: 22
Explanation: You played 10 full rounds from 21:30 to 00:00 and 12 full rounds from 00:00 to 03:00.
10 + 12 = 22.

Constraints:

loginTime and logoutTime are in the format hh:mm.
00 <= hh <= 23
00 <= mm <= 59
loginTime and logoutTime are not equal.

Solution (Java)

class Solution {
    private static final int MID_NIGHT_END = 1440;
    private static final int MID_NIGHT_START = 0;
    private static final int ROUND_INTERVAL = 15;

    public int numberOfRounds(String loginTime, String logoutTime) {
        int loginSerializeTime = serializeTime(loginTime);
        int logoutSerializeTime = serializeTime(logoutTime);
        if (logoutSerializeTime - 14 < loginSerializeTime
                && logoutSerializeTime > loginSerializeTime) {
            return 0;
        }
        loginSerializeTime = maskSerializeTime(loginSerializeTime, 14);
        logoutSerializeTime = maskSerializeTime(logoutSerializeTime, 0);
        if (loginSerializeTime == logoutSerializeTime) {
            return 0;
        }
        if (loginSerializeTime > logoutSerializeTime + 14) {
            return calculateFullRounds(loginSerializeTime, MID_NIGHT_END)
                    + calculateFullRounds(MID_NIGHT_START, logoutSerializeTime);
        }
        return calculateFullRounds(loginSerializeTime, logoutSerializeTime);
    }

    private int maskSerializeTime(int serializeTime, int mask) {
        return (serializeTime + mask) / ROUND_INTERVAL * ROUND_INTERVAL;
    }

    private int serializeTime(String time) {
        return Integer.parseInt(time.substring(0, 2)) * 60 + Integer.parseInt(time.substring(3, 5));
    }

    private int calculateFullRounds(int login, int logout) {
        return (logout - login) / ROUND_INTERVAL;
    }
}

Explain:

nope.

Complexity:

Time complexity : O(n).
Space complexity : O(n).