Given two strings s and t, return true if they are exactly $1$ edit distance apart, otherwise return false.

A string s is considered to be one edit distance away from a string t if it is possible to perform exactly one of the following operations:

• Insert exactly $1$ character into s to obtain t

• Delete exactly $1$ character from s to obtain t

• Replace exactly $1$ character in s with a different character to obtain t

Constraints:

• $0 \leq$ s.length, t.length $\leq 10^4$

• s and t consist of lowercase letters, uppercase letters, and digits.

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.