Datadog | SWE Intern (Intern) | Coding | Online Assessment

You are given an array timestamps of length n, where each element represents the time (in seconds) of a login attempt. Two login attempts at indices (i, j) are considered suspicious if: i < j The absolute difference between their timestamps is less than or equal to timeWindow , i.e "[timestamps[i] timestamps[j]] <= timeWindow Your task is to determine the total number of suspicious pairs in the array. Return the coun...