LeetCode
Question
#1235 Maximum Profit in Job Scheduling
Question Details
LeetCode #1235: Maximum Profit in Job Scheduling. Difficulty: Hard. Topics: Array, Binary Search, Dynamic Programming, Sorting. Asked at Verkada in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →About This Question
This is a reported interview question from a verkada interview for a swe role during the coding round.
It covers the following topics: Arrays, Binary Search, Dynamic Programming, Sorting .
Difficulty rating: Hard
More Verkada Interview Questions
1p3a
Verkada Store Front Tech Phone Screen Interview Experience
LeetCode
#986 Interval List Intersections
InterviewDB
Camera API: Design an OOP Camera Control API for a Multi-Camera System
InterviewDB
Camera Intensity: Compute Pixel Intensity Statistics Across a Camera Feed
1p3a
Verkada Tech Phone Screen: Camera Failure Aggregation Problem