MediumAcceptance: 32.1%
2. Add Two Numbers
Description
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.
Examples
Example 1
Input: l1 = [2,4,3], l2 = [5,6,4]
Output: [7,0,8]
Explanation: 342 + 465 = 807.
Constraints
- •The number of nodes in each linked list is in the range [1, 100].
- •0 <= Node.val <= 9
- •It is guaranteed that the list represents a number that does not have leading zeros.
Topics
Linked ListMathRecursion
💡 Tip: Start with a brute force solution and then optimize. Don't worry about performance initially.
Want more challenges?
Explore more coding challenges and improve your problem-solving skills
Browse All Challenges →