Given an integer array hours representing the daily hours worked by an employee.

A day is considered a tiring day if the employee works strictly more than $8$ hours.

A well performing interval is a contiguous sequence of days where the total count of tiring days is strictly greater than the total count of non tiring days.

Return the maximum length of a well performing interval.

Constraints:

• $1 \leq$ hours.length $\leq 10^4$

• $0 \leq$ hours[i] $\leq 16$

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.