Add Two Numbers (Forward Order Linked Lists)

bloomberg

Problem: Add Two Numbers (Forward Order Linked Lists)

You are given two singly linked lists l1 and l2. Each node contains a single digit (0-9). The digits are stored in forward order...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: