solution copied from discuss for #2

SouvikDcoder · SouvikDcoder · commit 86e44d570e1b · 2022-10-21T11:23:26.000+05:30
diff --git a/leetcode_kuro_RnD.ipynb b/leetcode_kuro_RnD.ipynb
@@ -8989,7 +8989,25 @@
         "\n",
         "n3_sum = n1+n2\n",
         "\n",
-        "n3_sum2 = str(n3_sum).reverse()\n"
+        "n3_sum2 = str(n3_sum).reverse()\n",
+        "\n",
+        "\n",
+        "#####################  Solution from discussions \n",
+        "\n",
+        "    carry = 0\n",
+        "    root = n = ListNode(0)\n",
+        "    while l1 or l2 or carry:\n",
+        "        v1 = v2 = 0\n",
+        "        if l1:\n",
+        "            v1 = l1.val\n",
+        "            l1 = l1.next\n",
+        "        if l2:\n",
+        "            v2 = l2.val\n",
+        "            l2 = l2.next\n",
+        "        carry, val = divmod(v1+v2+carry, 10)\n",
+        "        n.next = ListNode(val)\n",
+        "        n = n.next\n",
+        "    return root.next\n"
       ]
     },
     {
