Search
⌘K
Get Premium
Leetcode 1751. Maximum Number of Events That Can Be Attended II
Given a list of weighted intervals and an integer k, pick at most k non-overlapping events (end days are inclusive) to maximize the total value. The core challenge is interval scheduling under a cardinality constraint, typically solved by sorting plus DP/memoization that uses binary search to jump to the next non-overlapping event.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.