✨ Day 7; Week 1 ✔️

Author: AkashRajpurohit

README.md

@@ -4,13 +4,14 @@
 
 [Challenge Link](https://leetcode.com/explore/challenge/card/november-leetcoding-challenge/)
 
-## Week 1 🚧
+## Week 1 ✅
 1. [Convert Binary Number in a Linked List to Integer](https://leetcode.com/explore/challenge/card/november-leetcoding-challenge/564/week-1-november-1st-november-7th/3516/) ➡️ [CPP Solution](Week1/getDecimalValue.cpp)
 2. [Insertion Sort List](https://leetcode.com/explore/challenge/card/november-leetcoding-challenge/564/week-1-november-1st-november-7th/3517/) ➡️ [CPP Solution](Week1/insertionSortList.cpp)
 3. [Consecutive Characters](https://leetcode.com/explore/challenge/card/november-leetcoding-challenge/564/week-1-november-1st-november-7th/3518/) ➡️ [CPP Solution](Week1/maxPower.cpp)
 4. [Minimum Height Trees](https://leetcode.com/explore/challenge/card/november-leetcoding-challenge/564/week-1-november-1st-november-7th/3519/) ➡️ [CPP Solution](Week1/findMinHeightTrees.cpp)
 5. [Minimum Cost to Move Chips to The Same Position](https://leetcode.com/explore/challenge/card/november-leetcoding-challenge/564/week-1-november-1st-november-7th/3519/) ➡️ [CPP Solution](Week1/minCostToMoveChips.cpp)
 6. [Find the Smallest Divisor Given a Threshold](https://leetcode.com/explore/challenge/card/november-leetcoding-challenge/564/week-1-november-1st-november-7th/3520/) ➡️ [CPP Solution](Week1/smallestDivisor.cpp)
+7. [Add Two Numbers II](https://leetcode.com/explore/challenge/card/november-leetcoding-challenge/564/week-1-november-1st-november-7th/3521/) ➡️ [CPP Solution](Week1/addTwoNumbers.cpp)
 
 ## Week 2 🚧
 Coming soon...

Week1/addTwoNumbers.cpp

@@ -0,0 +1,61 @@
+/**
+ * Definition for singly-linked list.
+ * struct ListNode {
+ *     int val;
+ *     ListNode *next;
+ *     ListNode() : val(0), next(nullptr) {}
+ *     ListNode(int x) : val(x), next(nullptr) {}
+ *     ListNode(int x, ListNode *next) : val(x), next(next) {}
+ * };
+ */
+class Solution {
+private:
+    ListNode* reverseList(ListNode* head) {
+        ListNode *curr = head, *prev = NULL, *next = NULL;
+        
+        while(curr != NULL) {
+            next = curr->next;
+            curr->next = prev;
+            
+            prev = curr;
+            curr = next;
+        }
+        
+        return prev;
+    }
+    
+    ListNode* addList(ListNode* l1, ListNode* l2) {
+        int sum = 0, carry = 0;
+        ListNode *dummy = new ListNode(-1);
+        ListNode *curr = dummy;
+        
+        while(l1 != NULL || l2 != NULL || carry != 0) {
+            sum = carry;
+            
+            if(l1 != NULL) {
+                sum += l1->val;
+                l1 = l1->next;
+            }
+            
+            if(l2 != NULL) {
+                sum += l2->val;
+                l2 = l2->next;
+            }
+            
+            ListNode* newNode = new ListNode(sum % 10);
+            curr->next = newNode;
+            curr = curr->next;
+            
+            carry = sum / 10;
+        }
+        
+        return dummy->next;
+    }
+public:
+    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
+        l1 = reverseList(l1);
+        l2 = reverseList(l2);
+        
+        return reverseList(addList(l1, l2));
+    }
+};