Given two strings s and goal, return true if you can swap two letters in s so the resulting string is equal to goal, or false otherwise.

Swapping letters is defined as taking two indices i and j (zero indexed) such that $i \neq j$ and swapping the characters at s[i] and s[j].

Constraints:

• $1 \leq$ s.length, goal.length $\leq 2 \cdot 10^4$

• s and goal consist of lowercase letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.