How should I practice Count Filename Pairs Related by One Swap?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google onsite interview problems in FastPrep.

Is Count Filename Pairs Related by One Swap associated with Google?

FastPrep tags this as a Google onsite interview coding practice problem when the problem catalog has that company and stage context.

Count Filename Pairs Related by One Swap

Google● MediumINTERNONSITE INTERVIEW

Problem statement

You are given a list of filenames. Count the unordered index pairs (i, j), with i < j, for which swapping exactly two distinct character positions in one filename makes it equal to the other.

The problem statement continues

Pro

Examples

Example 1

filenames = ["ab","ba","ab"]return = 2

Pairs (0,1) and (1,2) qualify. The identical ab entries have no repeated character, so they do not qualify.

FastPrep Pro

Reported in 1 Google interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

Full problem statement and constraints
2 more worked examples, explained
Guided hints and editorial
Run your code on real test cases

$8.25/month

$99 billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week

See Google hiring insights