A number (n) is represented in Linked List such that each digit corresponds to a node in linked list. Add 1 to it.
Input:
You have to complete the method which takes one argument: the head of the linked list. You should not read any input from stdin/console.. There are multiple test cases. For each test case, this method will be called individually
Output:
Your function should return pointer to head of the modified list.
Constraints:
1 <=T<= 50
1 <=n<= 10000
Example:
Input:
4
456
123
999
1879
Output:
457
124
1000
1880
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.
| VISHESHA SADU | 27 |
| ghanshyam648 | 25 |
| Biswajit3 | 21 |
| karthik_kasaragadda | 20 |
| tanya_sharma | 18 |
| KshatriyaYash | 1066 |
| nikhil_sojan | 978 |
| lonecoder | 935 |
| mazumderrohit8 | 864 |
| SumitSingh27 | 832 |
| blackshadows | 5327 |
| Ibrahim Nash | 5215 |
| akhayrutdinov | 5111 |
| mb1973 | 4468 |
| Quandray | 4444 |