# Berry Sethi Marking Construction: Study Guide

Berry Sethi Marking Construction shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Mark each regex symbol with its position, compute first/last/follow on the marked expression, and drop the marks to obtain the Glushkov automaton.

## 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) after a linear-time walk that fills the follow relation.

## Common mistake

Forgetting that a nullable child lets follow-sets jump across a concatenation.

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