Given an absolute path for a Unix-style file system (always beginning with '/'), transform it into its simplified canonical form.

The Unix-style file system follows these rules:

• A single period '.' represents the current directory.

• A double period '..' represents the parent directory.

• Multiple consecutive slashes (e.g., '//' or '///') are treated as a single slash '/'.

• Any sequence of periods that does not match the above rules is treated as a valid directory or file name (e.g., '...' and '....' are valid names).

The resulting canonical path must satisfy the following:

• It must begin with a single slash '/'.

• Directories must be separated by exactly one slash '/'.

• It must not end with a trailing slash '/', unless it is the root directory.

• It must not contain any '.' or '..' components used to denote current or parent directories.

Return the simplified canonical path.

Constraints:

• $1 \leq$ path.length $\leq 3000$

• path consists of English letters, digits, period '.', slash '/', or underscore '_'

• path is a valid absolute Unix path

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.