# Li Chao Segment Tree For Lines: Study Guide

Li Chao Segment Tree For Lines shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Each node stores one line; on insert, the new line wins on a prefix or suffix of the node interval and the loser is pushed to a child.

## 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(log^2 n) per insert or query on a coordinate-compressed x-axis.

## Common mistake

Comparing lines only at the midpoint and dropping the one that is better on an endpoint.

## 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 coding interview assistant.