# Groups Of Special Equivalent Strings: Practice Notes

Groups Of Special Equivalent Strings shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Two strings are special-equivalent if you can swap even-indexed letters with even-indexed letters (and odds with odds) to match. Canonicalize by sorting the even and odd characters separately; the number of groups is the number of unique signatures.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(total length * log A).

## Common mistake

Sorting the whole string (which allows even/odd mixing) or treating the strings as anagrams.

## 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 https://www.linkjob.ai/.