CPMagical CP Library

Problem solution · Python

Length of the Longest Increasing Path

Length of the Longest Increasing Path: a Python solution using sorting and greedy selection. Learn the idea, check the complexity, and read the full code, with credit to walkccc LeetCode Solutions.

Technique
Sorting and greedy selection
Source
walkccc LeetCode Solutions
Length
22 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

Sorting and greedy selection

For Length of the Longest Increasing Path, the implementation first exposes a useful order, then scans that order while making locally justified choices.

  1. Choose the key that reveals the greedy or grouping structure.
  2. Sort the relevant records by that key.
  3. Scan in order, maintaining the invariant that makes each local choice safe.

Code notes

  • 22 lines of Python from the credited upstream file 3288.py.
  • The implementation visibly relies on sequence storage.
  • No explicit loop blocks detected.

Complexity

Sorting is typically the dominant term unless the subsequent scan uses a more expensive nested operation.

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 codeLength of the Longest Increasing Path · PythonPython
Use this to learn the idea, then write your own version.
class Solution:  def maxPathLength(self, coordinates: list[list[int]], k: int) -> int:    xk, yk = coordinates[k]    leftCoordinates = [(x, y) for x, y in coordinates if x < xk and y < yk]    rightCoordinates = [(x, y) for x, y in coordinates if x > xk and y > yk]    return (1 +            self._lengthOfLIS(leftCoordinates) +            self._lengthOfLIS(rightCoordinates))   # Similar to 300. Longest Increasing Subsequence  def _lengthOfLIS(self, coordinates: list[tuple[int, int]]) -> int:    coordinates.sort(key=lambda x: (x[0], -x[1]))    # tail[i] := the minimum tail of all the increasing subsequences having    # length i + 1    tail = []    for _, y in coordinates:      if not tail or y > tail[-1]:        tail.append(y)      else:        tail[bisect.bisect_left(tail, y)] = y    return len(tail)

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 ↗