Distinct Character Tracking (Sets, Counters, Windows)

Distinct character tracking asks how many different symbols appear, whether a window has all unique letters, or whether two multisets match. Sets and counters are the two standard tools.

Why this shows up in the real world

Password strength meters reward diversity of character classes. Inventory slotting tracks how many unique SKUs appear per aisle scan.

Core idea (explained for students)

len(set(s)) counts distinct characters but loses multiplicity. Counter(s) keeps counts for anagram-style checks. Sliding distinct-count problems combine a frequency map with a variable window.

Try this in Python

from collections import Counter


def distinct_count(s: str) -> int:
    return len(set(s))


def multiset_equal(a: str, b: str) -> bool:
    return Counter(a) == Counter(b)


print(distinct_count("abac"), multiset_equal("listen", "silent"))

Common mistakes

• set on strings with spaces—decide if space counts as a character class.
• Unicode normalization changing perceived distinctness (e composed vs decomposed).

Key takeaways

• Pick set vs Counter based on whether multiplicity matters.
• For streaming input, update counts incrementally instead of rebuilding sets each chunk.