The Runtime Theory
mediumLeetCode#dynamic-programming#interval-dp

Longest Palindromic Subsequence

Return the length of the longest subsequence that reads the same both directions.

The Runtime Theory Team25 min read
Solve it

Solving happens on the judge — come back and mark it done

Sample cases

ins="bbbab"

out4

ins="cbbd"

out2

ins="a"

out1

Return the length of the longest subsequence that reads the same both directions.

A good solution should

  • State the invariant or decision rule that makes the approach correct.
  • Explain time and space costs in terms of input size and required output.
  • Handle empty, minimal, duplicate, and boundary-shaped inputs.

Reasoning prompt

Use interval states: matching endpoints extend an inner solution; otherwise discard one endpoint and take the better result.

Use the linked judge for the canonical challenge. The examples above are compact TRT checks; create additional tests around the boundary most likely to break your invariant.

More practice in this topic

One dispatch a week

The trace behind each problem, the tradeoff that explains it, and one technical dispatch per week — no noise.

One technical dispatch per week. No noise.

Not started

Sign in to save your learning progress.

Sign in to save