The Question.:
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
My solution can be found here.
The hard part is figuring out how to create new nodes and move to next node of the linked list. Once I got this the problem was not too hard to solve.
The hard part is figuring out how to create new nodes and move to next node of the linked list. Once I got this the problem was not too hard to solve.