You are given two arrays of strings event1 and event2, where event1 = [startTime1, endTime1] and event2 = [startTime2, endTime2]. Each string represents a time of day in the HH:MM format.

A conflict occurs if the two events have any time in common, including a single point in time.

Return true if there is a conflict between the two events, otherwise return false.

Constraints:

• event1.length $==$ event2.length $== 2$

• event1[i].length $==$ event2[i].length $== 5$

• startTime_1 $\leq$ endTime_1

• startTime_2 $\leq$ endTime_2

• All the event times follow the HH:MM format.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.