Skip to main content

Command Palette

Search for a command to run...

Solving Leetcode Interviews in Seconds with AI: Largest Time for Given Digits

Updated
3 min read

Introduction

In this blog post, we will explore how to solve the LeetCode problem "949" using AI. LeetCode is a popular platform for preparing for coding interviews, and with the help of AI tools like Chatmagic, we can generate solutions quickly and efficiently - helping you pass the interviews and get the job offer without having to study for months.

Problem Statement

Given an array arr of 4 digits, find the latest 24-hour time that can be made using each digit exactly once. 24-hour times are formatted as "HH:MM", where HH is between 00 and 23, and MM is between 00 and 59. The earliest 24-hour time is 00:00, and the latest is 23:59. Return the latest 24-hour time in "HH:MM" format. If no valid time can be made, return an empty string. Example 1: Input: arr = [1,2,3,4] Output: "23:41" Explanation: The valid 24-hour times are "12:34", "12:43", "13:24", "13:42", "14:23", "14:32", "21:34", "21:43", "23:14", and "23:41". Of these times, "23:41" is the latest. Example 2: Input: arr = [5,5,5,5] Output: "" Explanation: There are no valid 24-hour times as "55:55" is not valid. Constraints: arr.length == 4 0 <= arr[i] <= 9

Explanation

  • Generate Permutations: Generate all possible permutations of the input array.
    • Validate and Find Maximum: For each permutation, check if it represents a valid 24-hour time. Keep track of the latest valid time found so far.
    • Return Result: If a valid time is found, return it in "HH:MM" format; otherwise, return an empty string.
  • Time Complexity: O(1) - since the input array size is fixed at 4, the number of permutations is limited to 4! = 24. Thus, it can be considered constant time. Space Complexity: O(1) - we are using constant extra space.

Code

    def largestTimeFromDigits(arr: list[int]) -> str:
    """
    Given an array arr of 4 digits, find the latest 24-hour time that can be made using each digit exactly once.
    24-hour times are formatted as "HH:MM", where HH is between 00 and 23, and MM is between 00 and 59.
    The earliest 24-hour time is 00:00, and the latest is 23:59.
    Return the latest 24-hour time in "HH:MM" format. If no valid time can be made, return an empty string.

    Example 1:
    Input: arr = [1,2,3,4]
    Output: "23:41"
    Explanation: The valid 24-hour times are "12:34", "12:43", "13:24", "13:42", "14:23", "14:32", "21:34", "21:43", "23:14", and "23:41".
    Of these times, "23:41" is the latest.

    Example 2:
    Input: arr = [5,5,5,5]
    Output: ""
    Explanation: There are no valid 24-hour times as "55:55" is not valid.

    Constraints:
    arr.length == 4
    0 <= arr[i] <= 9
    """
    import itertools

    max_time = ""

    for perm in itertools.permutations(arr):
        hours = perm[0] * 10 + perm[1]
        minutes = perm[2] * 10 + perm[3]

        if 0 <= hours <= 23 and 0 <= minutes <= 59:
            time_str = "{:02d}:{:02d}".format(hours, minutes)
            if max_time == "" or time_str > max_time:
                max_time = time_str

    return max_time

More from this blog

C

Chatmagic blog

2894 posts