Tap here to switch tabs
Problem
Submissions

Problem: High-Access Employees

High-Access Employees identifies employees whose access log contains at least three visits with less than 60 minutes between the earliest and latest. Return their names in any order.

Statement

You are given a two dimensional array access_times, where each element access_times[i] = [name, time] represents an employee named name who accessed a system at time.

The time is represented as a 44 digit string in 2424 hour format.

An employee is considered a high access employee if they access the system 33 or more times within any 11 hour time frame.

Return a list containing the names of all high access employees. The names may be returned in any order.

Note: A 11 hour time frame spans strictly less than 6060 minutes between the earliest and latest access times within that frame.

Constraints:

  • 1≤1 \leq access_times.length ≤100\leq 100

  • access_times[i].length =2= 2

  • 1≤1 \leq access_times[i][0].length ≤10\leq 10

  • access_times[i][0] consists only of English small letters.

  • access_times[i][1].length =4= 4

  • access_times[i][1] is in 2424 hour time format.

  • access_times[i][1] consists only of characters from ′0′'0' to ′9′'9'.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: High-Access Employees

High-Access Employees identifies employees whose access log contains at least three visits with less than 60 minutes between the earliest and latest. Return their names in any order.

Statement

You are given a two dimensional array access_times, where each element access_times[i] = [name, time] represents an employee named name who accessed a system at time.

The time is represented as a 44 digit string in 2424 hour format.

An employee is considered a high access employee if they access the system 33 or more times within any 11 hour time frame.

Return a list containing the names of all high access employees. The names may be returned in any order.

Note: A 11 hour time frame spans strictly less than 6060 minutes between the earliest and latest access times within that frame.

Constraints:

  • 1≤1 \leq access_times.length ≤100\leq 100

  • access_times[i].length =2= 2

  • 1≤1 \leq access_times[i][0].length ≤10\leq 10

  • access_times[i][0] consists only of English small letters.

  • access_times[i][1].length =4= 4

  • access_times[i][1] is in 2424 hour time format.

  • access_times[i][1] consists only of characters from ′0′'0' to ′9′'9'.