Given a non-negative number represented as a linked list, add one to it. The digits are stored such that the most significant digit is at the head of the list.

To add one to a linked list, traverse the list and add 1 to the last node's value. If it overflows, create a new node.

• Traverse the linked list until the last node

• Add 1 to the value of the last node

• If ...read more