Longest Heart-Rate Subarray | Dataford Interview Questions

Given an array of workout metrics, write an optimized algorithm to find the longest contiguous sub-array where the user's heart rate remained within a target zone for Tempo.

Treat the workout metrics array as heart-rate readings in chronological order. Implement longest_zone_streak(metrics, lower, upper), returning the maximum number of consecutive readings whose values are between lower and upper, inclusive. Return 0 when no reading is in the zone.

Constraints

1 <= metrics.length <= 100000
30 <= metrics[i] <= 250
30 <= lower <= upper <= 250

Function Signature

def longest_zone_streak(metrics, lower, upper):

Your question is Longest Heart-Rate Subarray. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Given an array of workout metrics, write an optimized algorithm to find the longest contiguous sub-array where the user's heart rate remained within a target zone for Tempo.

Constraints

1 <= metrics.length <= 100000
30 <= metrics[i] <= 250
30 <= lower <= upper <= 250

Function Signature

def longest_zone_streak(metrics, lower, upper):

Your question is Longest Heart-Rate Subarray. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.