Add Two Number 📯
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Input: l1 = [2,4,3], l2 = [5,6,4]
Explanation: 342 + 465 = 807.
Input: l1 = , l2 = 
Input: l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
- The number of nodes in each linked list is in the range
0 <= Node.val <= 9
- It is guaranteed that the list represents a number that does not have leading zeros.
O(l) or Linear time (where l is the size of the list that has more nodes in it)
There is only one loop in the code that runs l times, and l is the size of the list which has more nodes in it, e.g. list1 has size 2 and list2 has size 9, the loop will run 9 times.