# Knuth Optimization Quadrangle DP: Study Guide

Knuth Optimization Quadrangle DP shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

When a DP cost satisfies quadrangle inequality, optimal split points are monotone, so each layer is filled in linear time after the previous one.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n^2) instead of O(n^3).

## Common mistake

Using the monotonicity bound from the wrong previous cell, which skips the true split.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI job interview answers in real time.