← Media.net questions

Good string swap sub-sequences

Filed under Media.net

The question

Given two strings A and B containing 1s and 2s with movement rules per character index, count the number of possible sub-sequences of swaps between A and B such that both strings become 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.