You are given the head of a singly linked list containing n nodes.

For each node in the list, find the value of the next greater node. The next greater node of a given node is the first node located after it in the list whose value is strictly greater than its value. If no subsequent node has a strictly greater value, the answer for that node is $0$.

Return an array of integers representing the next greater node value for each node in the list, ordered from the first node to the last.

Constraints:

• The number of nodes in the list is n.

• $1 \leq$ n $\leq 10^4$

• $1 \leq$ Node.val $\leq 10^9$

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.