I applied online through LinkedIn.

I received a reply for an online coding test within a week. They gave me 7 days to complete the online coding test.

The coding test had 2 questions, and I was given 90 minutes.

Q1: There is a garden with N slots. In each slot, there is a flower. The N flowers will bloom one by one in N days. In each day, exactly one flower blooms and it remains in the blooming status.

Given an array flowers consisting of numbers from 1 to N. Each number in the array represents the position where a flower will open on a specific day. For example, flowers[i] = x means that the flower blooming on day i will be at position x, where i and x are in the range from 1 to N.

Also given an integer k, you need to output the day on which there exist two blooming flowers such that the number of flowers between them is k and these flowers are not blooming. If no such day exists, output -1.

Q2: Given a time represented in the format "HH", form the next closest time by reusing the current digits. There is no limit on how many times a digit can be reused.

You may assume the given input string is always valid. For example, "01:34" and "12:09" are valid, while "1:34" and "12:9" are invalid.

Example 1:

Input: "19:34" Output: "19:39" Explanation: The next closest time formed by reusing the digits 1, 9, 3, and 4 is 19:39, which occurs 5 minutes later. It is not 19:33, because that would occur 23 hours and 59 minutes later.

Example 2:

Input: "23:59" Output: "22:22" Explanation: The next closest time formed by reusing the digits 2, 3, 5, and 9 is 22:22. It may be assumed that the returned time is for the next day, as it is numerically smaller than the input time.