Modulo Cycle Pattern Recognition on Strings

Strings and arrays that repeat cyclically satisfy s[i] == s[i % len(s)]. Modulo also appears when rotating cursors around a ring buffer of characters.

Why this shows up in the real world

Marquee displays loop the same message forever using modular indexing. Round-robin DNS cycles hostnames—same modulo idea at a larger scale.

Core idea (explained for students)

Normalize any index with % n after handling negatives: i % n in Python already yields non-negative remainder for positive n. For rotations: s[(i+k)%n].

Try this in Python

def cyclic_char(s: str, i: int) -> str:
    if not s:
        raise ValueError("empty")
    return s[i % len(s)]


print(cyclic_char("abcde", 12))

Common mistakes

• Negative modulo semantics differs by language—Python’s % is safe for positive divisor.
• Using % before bounds checks when n==0—guard empty strings.

Key takeaways

• Draw the circle of indices 0..n-1 when teaching rotation.
• Combine modulo with prefix sums for cyclic cumulative problems.