Search⌘ K
AI Features

Solution: Check if One String Swap Can Make Strings Equal

Explore how to assess whether two strings can become equal by performing zero or one character swap on one string. Learn to identify differing indices and verify conditions that allow a single swap to resolve differences, enhancing your problem-solving for string manipulation challenges.

Statement

You are given two strings s1 and s2 of equal length. A string swap operation allows you to choose two indices in a string (not necessarily different) and swap the characters at those indices.

Determine whether it is possible to make the two strings equal by performing at most one string swap on exactly one of the strings. Return TRUE if this is possible, and FALSE otherwise.

Note: The swap is performed on exactly one of the two strings, and you may choose to perform zero or one swap.

Constraints:

  • 11 \leq ...