Given an array of string paths folder, remove all subfolders and return the remaining folders in any order.

A folder path folder[i] is considered a subfolder of folder[j] if folder[i] starts with folder[j] followed by '/'. For instance, "/a/b" is a subfolder of "/a", whereas "/ab" is not a subfolder of "/a".

Constraints:

• $1 \leq$ folder.length $\leq 4 imes 10^4$

• $2 \leq$ folder[i].length $\leq 100$

• folder[i] contains only lowercase letters and '/'.

• folder[i] always starts with the character '/'.

• Each folder name is unique.

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.