High-Access Employees at Atlassian

Medium47.3% acceptance

This problem has 75.0% frequency at Atlassian.

Problem Description

You are given a 2D **0-indexed** array of strings, `access_times`, with size `n`. For each `i` where `0 <= i <= n - 1`, `access_times[i][0]` represents the name of an employee, and `access_times[i][1]` represents the access time of that employee. All entries in `access_times` are within the same day...

Read full problem and hints

Topics

Also asked at 1 company


More Atlassian Questions

View all Atlassian questions