CPMagical CP Library

Problem solution · Python

Maximum Score of Non-overlapping Intervals

Maximum Score of Non-overlapping Intervals: a Python solution using dynamic programming. Learn the idea, check the complexity, and read the full code, with credit to walkccc LeetCode Solutions.

Technique
Dynamic programming
Source
walkccc LeetCode Solutions
Length
39 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Dynamic programming

For Maximum Score of Non-overlapping Intervals, the implementation records answers for smaller states and reuses them to build the requested result without repeating work.

  1. Define precisely what one DP state represents.
  2. Establish the base cases before transitions are evaluated.
  3. Process states in dependency order and combine only already-known values.

Code notes

  • 39 lines of Python from the credited upstream file 3414.py.
  • The implementation visibly relies on sequence storage, cached states.
  • No explicit loop blocks detected.

Complexity

Multiply the number of reachable states by the work performed for each transition, then include the stored state table in memory usage.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from walkccc LeetCode Solutions by P.-Y. Chen (walkccc) and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeMaximum Score of Non-overlapping Intervals · PythonPython
Use this to learn the idea, then write your own version.
from dataclasses import dataclass  @dataclass(frozen=True)class T:  weight: int  selected: tuple[int]   def __iter__(self):    yield self.weight    yield self.selected  class Solution:  def maximumWeight(self, intervals: list[list[int]]) -> list[int]:    intervals = sorted((*interval, i) for i, interval in enumerate(intervals))     @functools.lru_cache(None)    def dp(i: int, quota: int) -> T:      """      Returns the maximum weight and the selected intervals for intervals[i..n),      where `quota` is the number of intervals that can be selected.      """      if i == len(intervals) or quota == 0:        return T(0, ())       skip = dp(i + 1, quota)       _, r, weight, originalIndex = intervals[i]      j = bisect.bisect_right(intervals, (r, math.inf))      nextRes = dp(j, quota - 1)      pick = T(weight + nextRes.weight,               sorted((originalIndex, *nextRes.selected)))      return (pick if (pick.weight > skip.weight or                       pick.weight == skip.weight and pick.selected < skip.selected)              else skip)     return list(dp(0, 4).selected)

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗