# Decode Ways: Walkthrough

Decode Ways shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

dp[i] is the number of ways to decode s[:i]; add dp[i-1] if s[i-1] is 1-9 and dp[i-2] if s[i-2:i] is 10-26.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Treating a leading zero as a valid single digit.

## 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 try it free.