Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 949 with 21 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 949 # by problem number
lcpy gen -s largest_time_for_given_digits # by problem name
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.
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.
Input: arr = [5,5,5,5]
Output: ""
Explanation: There are no valid 24-hour times as "55:55" is not valid.
arr.length == 40 <= arr[i] <= 9from itertools import permutations
class Solution:
# Time: O(4! * 4)
# Space: O(1)
def largest_time_from_digits(self, arr: list[int]) -> str:
best = ""
for h1, h2, m1, m2 in permutations(arr):
hour = h1 * 10 + h2
minute = m1 * 10 + m2
if hour < 24 and minute < 60:
candidate = f"{hour:02d}:{minute:02d}"
if candidate > best:
best = candidate
return best
| Time | Space |
|---|---|
| O(4! * 4) | O(1) |