solution added.

Author: 149ps

30 Days September Challange/Week 1/1. Largest Time for Given Digits/solution.py

@@ -0,0 +1,33 @@
+"""
+Given an array of 4 digits, return the largest 24 hour time that can be made.
+
+The smallest 24 hour time is 00:00, and the largest is 23:59.  Starting from 00:00, a time is larger if more time has elapsed since midnight.
+
+Return the answer as a string of length 5.  If no valid time can be made, return an empty string.
+
+
+
+Example 1:
+
+Input: [1,2,3,4]
+Output: "23:41"
+Example 2:
+
+Input: [5,5,5,5]
+Output: ""
+"""
+
+
+class Solution:
+    def largestTimeFromDigits(self, A: List[int]) -> str:
+        temp = [t for t in itertools.permutations(A) if t[:2] < (2, 4) and t[2:] < (6, 0)]
+        if temp:
+            result = max(temp)
+        else:
+            return ''
+        final = ''
+        for i, num in enumerate(result):
+            if i == 2:
+                final += ':'
+            final += str(num)
+        return final