# SA IS Induced Sorting Suffix Array: Study Guide

SA IS Induced Sorting Suffix Array shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Induce L-type and S-type suffixes from a reduced subsequence of LMS suffixes; recurse only on the LMS string.

## 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) time and extra linear memory.

## Common mistake

Classifying the last character as L-type without the sentinel rule, which flips the whole type array.

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