Add files via upload

DARKcoder37 · web-flow · commit 3582b3ff83a7 · 2023-04-12T19:30:56.000+05:30
diff --git a/Problem Solution/2) Add two number (medium)/Add two numbers.txt b/Problem Solution/2) Add two number (medium)/Add two numbers.txt
@@ -0,0 +1,29 @@
+2. Add Two Numbers (Medium)
+
+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:
+
+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.
diff --git a/Problem Solution/2) Add two number (medium)/sol.py b/Problem Solution/2) Add two number (medium)/sol.py
@@ -0,0 +1,18 @@
+class Solution:
+  def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
+    dummy = ListNode(0)
+    curr = dummy
+    carry = 0
+
+    while carry or l1 or l2:
+      if l1:
+        carry += l1.val
+        l1 = l1.next
+      if l2:
+        carry += l2.val
+        l2 = l2.next
+      curr.next = ListNode(carry % 10)
+      carry //= 10
+      curr = curr.next
+
+    return dummy.next
