2. Add Two Numbers

Author: Tushar Borole

.idea/workspace.xml

@@ -79,6 +79,7 @@
 | 215  | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/)                                                                                   | [Solution](largest_element%20_in_an_array.js)                                                                 | 68 ms            | 35.9 MB              | Medium     |                 |                  |                                                                                |
 | 74   | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/)                                                                                                             | [Solution](search_a_2d_matrix.js)                                                                             | 48 ms            | 34.5 MB              | Medium     |                 |                  |                                                                                |
 | 540  | [Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array/)                                                                                 | [single_element_in_a_sorted_array.js](single_element_in_a_sorted_array.js)                                    | 60 ms            | 35.2 MB              | Medium     |                 |                  |                                                                                |
+| 2    | [ Add Two Numbers](https://leetcode.com/problems/add-two-numbers)                                                                                                                   | [add_two_numbers.js](add_two_numbers.js)                                                                      |                  |                      | Medium     |                 |                  |                                                                                |
 | 347  | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/)                                                                                                   | [top_k_frequent_elements.js](top_k_frequent_elements.js)                                                      | 80 ms            | 39.1 MB              | Medium     |                 |                  |                                                                                |
 | 39   | [Combination Sum](https://leetcode.com/problems/combination-sum/)                                                                                                                   | [combination_sum.js](combination_sum.js)                                                                      | 72 ms            | 35.8 MB              | Medium     |                 |                  |                                                                                |
 | 40   | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii/)                                                                                                             | [combination_sum_II.js](combination_sum_II.js)                                                                | 84 ms            | 37.6 MB              | Medium     |                 |                  |                                                                                |

README.md

@@ -0,0 +1,86 @@
+// https://leetcode.com/problems/add-two-numbers/
+function ListNode(val) {
+  this.val = val;
+  this.next = null;
+}
+
+let arrayToList = function(totalArray) {
+  let outNode = new ListNode(totalArray[0]);
+  let current = outNode;
+
+  for (let i = 1; i < totalArray.length; i++) {
+    current.next = new ListNode(totalArray[i]);
+    current = current.next;
+  }
+  return outNode;
+};
+
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val) {
+ *     this.val = val;
+ *     this.next = null;
+ * }
+ */
+/**
+ * @param {ListNode} l1
+ * @param {ListNode} l2
+ * @return {ListNode}
+ */
+var addTwoNumbers = function(l1, l2) {
+  let l1Array = [];
+  const before = new ListNode();
+  let tail = before;
+  let c = 0;
+
+  while (l1 || l2 || c) {
+    const v1 = l1 ? l1.val : 0;
+    const v2 = l2 ? l2.val : 0;
+    const v = v1 + v2 + c;
+
+    tail.next = new ListNode(v % 10);
+    tail = tail.next;
+    c = v >= 10 ? 1 : 0;
+    l1 = l1 && l1.next;
+    l2 = l2 && l2.next;
+  }
+
+  return before.next;
+};
+
+addTwoNumbers(
+  arrayToList([
+    1,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    1
+  ]),
+  arrayToList([5, 6, 4])
+); //?