Given two numbers represented by two linked lists of size N and M. The task is to return a sum list. The sum list is a linked list representation of the addition of two input numbers.
Example 1:
Input:
N = 2
valueN[] = {4,5}
M = 3
valueM[] = {3,4,5}
Output: 3 9 0
Explanation: For the given two linked
list (4 5) and (3 4 5), after adding
the two linked list resultant linked
list will be (3 9 0).
Example 2:
Input:
N = 2
valueN[] = {6,3}
M = 1
valueM[] = {7}
Output: 7 0
Explanation: For the given two linked
list (6 3) and (7), after adding the
two linked list resultant linked list
will be (7 0).
Your Task:
The task is to complete the function addTwoLists() which has node reference of both the linked lists and returns the head of the new list.
Expected Time Complexity: O(N) + O(M)
Expected Auxiliary Space: O(N) + O(M)
Constraints:
1 <= N, M <= 5000
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.
| Umakant_Dubey | 314 |
| binod_gotiyo | 307 |
| lone_walker | 304 |
| NaveenGarg2 | 235 |
| ArpitGupta8 | 233 |
| saiujwal13083 | 799 |
| ppsvikhyat17 | 712 |
| generic_coder | 630 |
| lone_walker | 590 |
| NaveenGarg2 | 554 |
| blackshadows | 5448 |
| Ibrahim Nash | 5438 |
| akhayrutdinov | 5111 |
| mb1973 | 4976 |
| Quandray | 4752 |