@@ -1,40 +0,0 @@
-/**
- * @param {number[]} candidates
- * @param {number} target
- * @return {number[][]}
- */
-var combinationSum = function(candidates, target) {
-    var result = [];
-
-    if (candidates == null || candidates.length === 0) { 
-        return result;
-    };
- 
-    var current = [];
-    candidates.sort();
- 
-    combinationSumHelper(candidates, target, 0, current, result);
- 
-    return result;
-};
-
-function combinationSumHelper(candidates, target, j, curr, result){
-    if(target === 0){
-        var temp = curr.slice();
-        result.push(temp);
-        return;
-    }
-  
-    for(var i=j; i<candidates.length; i++){
-        if(target < candidates[i]) {
-            return;
-        }
-        curr.push(candidates[i]);
-        combinationSumHelper(candidates, target - candidates[i], i, curr, result);
-        curr.pop(); 
-    }
- }
-
-const candidates = [2,3,6,7];
-const target = 7;
-console.log(combinationSum(candidates, target));
@@ -0,0 +1,23 @@
+function mergeTwoSortedLists (l1, l2) {
+
+    let mergedLinkedListHead = { val : -1, next : null }; // create dummy node to get started
+    let runner = mergedLinkedListHead;
+
+    while(l1 && l2) {
+        if(l1.val > l2.val) {
+            runner.next = l2;
+            l2 = l2.next;
+        } else {
+            runner.next = l1;
+            l1 = l1.next;
+        }
+        runner = runner.next;
+    }
+
+    // l1 = 1->2->3, l2 = 10->20->30
+    // In that case l1, will point to null and while loop will break
+    // Simply point runner to l2. We do not have to add individual nodes
+    runner.next = l1 || l2;
+
+    return mergedLinkedListHead.next;
+}