Longest Well-Performing Interval

Convert days to +1 (hours>8) and -1 (hours<=8) and find the longest contiguous subarray whose sum is >0. This reduces to finding the farthest pair of prefix sums with a positive difference, solvable in O(n) using prefix-sum techniques (monotonic stack or hashmap).