You are given a $0$ indexed array of strings words.

In a single operation, you can select any index i such that $0 < i <$ words.length where words[i] and words[i - 1] are anagrams of each other, and delete words[i] from words.

Repeat this process until no such index i can be chosen. Return the resulting array words.

Note: An anagram is a word created by rearranging the letters of a different word, using all original letters exactly once.

Constraints:

• $1 \leq$ words.length $\leq 100$

• $1 \leq$ words[i].length $\leq 10$

• words[i] consists 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.