From c191441bc15816a29bd25bcd68b8d04a9b2894c0 Mon Sep 17 00:00:00 2001 From: Deven <63876261+devenperez@users.noreply.github.com> Date: Wed, 26 Nov 2025 17:04:38 -0500 Subject: [PATCH] Create README - LeetHub --- 0002-add-two-numbers/README.md | 35 ++++++++++++++++++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 0002-add-two-numbers/README.md diff --git a/0002-add-two-numbers/README.md b/0002-add-two-numbers/README.md new file mode 100644 index 0000000..466f5e3 --- /dev/null +++ b/0002-add-two-numbers/README.md @@ -0,0 +1,35 @@ +
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.
+ +You may assume the two numbers do not contain any leading zero, except the number 0 itself.
+ ++
Example 1:
+
++Input: l1 = [2,4,3], l2 = [5,6,4] +Output: [7,0,8] +Explanation: 342 + 465 = 807. ++ +
Example 2:
+ ++Input: l1 = [0], l2 = [0] +Output: [0] ++ +
Example 3:
+ ++Input: l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9] +Output: [8,9,9,9,0,0,0,1] ++ +
+
Constraints:
+ +[1, 100].0 <= Node.val <= 9