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:

• $1 \leq$ s1.length, s2.length $\leq 100$

• s1.length $=$ s2.length

• s1 and s2 consist of only lowercase English letters. ...