Two strings word1 and word2 are considered almost equivalent if the absolute difference between the frequencies of every character from 'a' to 'z' in word1 and word2 is at most $3$.

Given two strings word1 and word2, return true if word1 and word2 are almost equivalent, or false otherwise.

Constraints:

• n $==$ word1.length $==$ word2.length

• $1 \leq$ n $\leq 100$

• word1 and word2 consist only of lowercase English 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.