Posted: 29 Jul, 2021
You are given a string that represents time in the format hh:mm. Some of the digits are blank (represented by ‘?’). Fill in ‘?’ such that the time represented by this string is the maximum possible. Maximum time: 23:59, minimum time: 00:00. You can assume that the input string is always valid.
For Example :
If the given input string is 1?:?8. We can replace the first ‘?’ with 9 and second with 5 to get the maximum time of 19:58.
Input Format :
The first line contains a single integer ‘T’ denoting the number of test cases Then each test case follows. The first line of each test case contains a string in the format of ‘hh:mm’.
Output Format :
For each test case print a string denoting the maximum possible time after replacing the ‘?’ marks with numbers.. Output for each test case will be printed in a separate line.
You are not required to print anything; it has already been taken care of. Just implement the function.
1 <= T <= 1000 |S| = 5 Time limit: 1 sec
Make the Equal
Posted: 18 Aug, 2022
Best time to buy and sell stock
Posted: 2 Sep, 2022
Best time to buy and sell stock II
Posted: 5 Sep, 2022
Posted: 8 Sep, 2022
Posted: 14 Sep, 2022