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 Docusign 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 docusign interview for a swe role during the coding round.
It covers the following topics: Arrays, Binary Search, Dynamic Programming, Sorting .
Difficulty rating: Hard