# Ternary Expression Parser: Explained

Ternary Expression Parser shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A nested T?X:Y expression. Scan from the right (or recurse from the first ?): each T?X:Y reduces to X or Y based on T. Because X and Y may themselves be ternaries, pairing each ? with its matching : from the right is the safe parse.

## 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).

## Common mistake

Splitting on the first colon (which may belong to a nested ternary on the left) instead of the matching one.

## 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 www.linkjob.ai.