# Add two numbers(reverse order) link list Problem - Leet Code Solution

July 23, 2019

## Problem Statement

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 contain a single digit. Add the two numbers and return it as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

``````Example:

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.``````

## Solution

``````private static ListNode addTwoNumbersHelper(ListNode l1, ListNode l2, int carry) {
if (l1 == null && l2 == null && carry == 0) {
return null;
}

int sum = carry;
if (l1 != null) { sum += l1.val; }
if (l2 != null) { sum += l2.val; }

if (sum > 9) {
sum = sum - 10;
carry = 1;
}
else {
carry = 0;
}

ListNode newNode = new ListNode(sum);
newNode.next = addTwoNumbersHelper(l1 != null ? l1.next : null, l2 != null ? l2.next : null, carry);
return newNode;
}
public static ListNode addTwoNumbers(ListNode l1, ListNode l2) {
}``````

## Explanation

This problem is rather simple. Since, the number is represented as link list in reverse order. i.e. the first node represent the last digit of a number. So, you can just started adding number as you traverse the two link list.

• take sum of two nodes, and carry if previously set.
• If the sum is more than single digit, set the carry.
• Now, new sum is our new node.
• Since, it will be last digit in the result number, and will be first node in link list.
• Its next pointer will be the one which will come out in next round of sum.
• So, we simply set its next and call same method in recursive manner. Which will again goes in recursive mode untill all link list is exhausted.
• And, we get our link list as sum.

## Similar Posts

### First Unique Character in a String - Leet Code Solution

Problem Statement Given a string, find the first non-repeating character in it…

### Two Sum Problem - Leet Code Solution

Problem Statement Given an array of integers, return indices of the two numbers…

### Calculate Max Profit - Buy and Sell Stocks Multiple Times - Leet Code Solution

Problem Statement Say you have an array prices for which the ith element is the…

### Maximum Subarray Problem

Problem Statement You are given an array of integers. And, you have find the…

### Longest Common Prefix - Leet Code Solution

Problem Statement Write a function to find the longest common prefix string…

### Min Priority Queue Implementation with Heap Data structure

Min Priority Queue is a data structure which manage a list of keys(values). And…

## Latest Posts

Introduction I was trying to upload images to my backend using rest APIs. I was…

### Spring - Learn Multiple Ways to use PackageScan Annotation

Introduction In this post, we will see multiple ways to use annotation…

Introduction I was using Paypal payment on one of my website, and suddenly lot…