The initial code test I completed had two questions.

The first was to find similar substrings. The other was to implement a linked list with the following operations:

• Push head
• Push tail
• Pop head

In more detail, the first question was to implement a function that could "correct typos." If one enters "monomon," one should be able to find "moon" twice.

The parameters for the function were the input string ("monomon") and the target string ("moon"), meaning two strings.

The function should be able to find "moon" within the string "monomon."

The only action that should be taken is to switch the places of two adjacent characters. For example:

"monomon" (switch 3rd and 4th characters) -> "moonmon" -> "moon" + "mon" -> the word "moon" has been found.