Algorithm · Verkada · Medium
(This problem is a variation of LeetCode 986: Interval List Intersections. If you haven't solved that one yet, you might want to tackle it first.) A surveillance camera records a time-ordered sequence of readings. Each reading consists of a timestamp and a motion intensity value (a float between 0 and 1). You are given the timestamps in an array times, the corresponding intensities in an array intensities, and a sensitivity threshold. Your task is to identify every maximal…
Checking your access…