# Split A String Into The Max Number Of Unique Substrings: Practice Notes
Split A String Into The Max Number Of Unique Substrings shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
DFS: at each index try every next cut, take the substring if it is not already in the set, and keep the maximum depth. Seen-set backtracking is enough for n <= 16.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (bitmasks, backtracking with pruning, 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 * 2^n).
## Common mistake
Using a greedy longest-new-substring cut, which is not always optimal.
## 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 interview helper that uses your resume.