Given an array representing error rates at different time (time is just the array index), e.g., ```[30, 40, 50, 55, 55, 60, 0, 10, 50]```, and a given time (index) `i`, and a threshold `threshold`. Determine if there is a time frame (subarray) that includes `i`, and satisfy `min(subarray) * len(subarray) >= threshold`, if yes, return `True`, if no, return `False`.\n\n**UPDATE**: I found the earlier post that discussed the almost the same problem: https://leetcode.com/discuss/interview-question/937739/Google-or-Phone-or-Find-max-unhealthy-period  \n\nThe LC problem # is 1793.

Given an array representing error rates at different time (time is just the array index), e.g., [30, 40, 50, 55, 55, 60, 0, 10, 50], and a given time (index) i,