Strings alphabetically between A and B without substring C
Filed under Gameskraft
The question
Given three strings A, B, and C where A and B have the same length n, find the number of strings of length n that are alphabetically greater than A and less than B, such that C is not a substring.
No write-up yet. Related questions below have one.
Related Gameskraft questions
Collected from public candidate posts and coding forums. Updated Nov 2026.