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.
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’.
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
Ninja And The Class Room
Ninja And The Strictly Increasing Array