Given the head of a non empty singly linked list representing a non negative integer, increment the integer by $1$ and return the head of the updated linked list.

The most significant digit is located at the head of the list, and each node contains a single digit.

Constraints:

• The number of nodes in the linked list is in the range $[1, 100]$.

• $0 \leq$ Node.val $\leq 9$

• The number represented by the linked list does not contain leading zeros except for the zero itself.

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.