# Lexicographically Smallest String After Applying Operations: Study Guide

Lexicographically Smallest String After Applying Operations shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

You may add a to every odd index (mod 10) any times, and rotate the string by b any times. BFS on the reachable strings (the state space is small: 10 even-add * 10 odd-add * n rotations, and when b is even you cannot touch even indices). Keep the minimum string seen.

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

## Common mistake

Only rotating or only adding, or treating a as applying to every index.

## 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 best AI tool for coding tests and OAs.