Available question text
Design an algorithm to get the load on the server in past 5 mins given the time stamps of requests.
Related questions
Continue with questions that share topics or the same question type.
- Determine if a Cell Is Reachable at a Given Time
Coding
- Given an array nums and a sliding window of size k moving from the very left to the very right, return the maximum value in the window for each position. Solve in O(n) time using a deque.
Coding
- Given an array of points where points[i] = [xi, yi] represents a point on the X-Y plane, return the k closest points to the origin (0, 0). Discuss expected vs. worst-case time complexity.
Coding
- Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Walk through Kadane's algorithm and explain the O(n) approach.
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Glassdoor · 1 record
Databricks
Design an algorithm to get the load on the server in past 5 mins given the time stamps of requests.
Reported Jul 2024 · 1 source report
Software Engineer
Source snapshot: Nov 12, 2026
View source