Given the root of a binary tree and an integer targetSum, return all root to leaf paths where the sum of the node values along the path equals targetSum. Each path should be returned as a list of node values.

Note: A leaf is a node with no children.

Constraints:

• The number of nodes in the tree is in the range $[0, 5000]$.

• $-1000 \leq$ Node.val $\leq 1000$

• $-1000 \leq$ targetSum $\leq 1000$

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.