CodingReported in a candidate post, Dec 2020
Good Strings Swapping
Filed under Media.net
The question
Given two 'good' strings A and B (where moving S[i] steps eventually covers all positions once), find the number of ways to swap characters at corresponding indices such that both strings remain 'good'.
No write-up yet. Related questions below have one.
Related Media.net questions
Collected from public candidate posts and coding forums. Updated Nov 2026.