# Find The Encrypted String: Study Guide
Find The Encrypted String shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Encrypt s by replacing each character with the character k positions later, cyclically. The answer is s[k:]+s[:k] (a rotation), or equivalently s[(i+k)%n] for each i.
## 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
Rotating in the wrong direction (s[-k:]+s[:-k] vs the problem's +k) or indexing without modulo.
## 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.