Problem 1 and 23 edited

Author: mkhuzaima

0001_Two_Sum.java

@@ -15,6 +15,7 @@ public int[] twoSum(int[] nums, int target) {
                 map.put(nums[i], i);
             }
         }
+        // not possible, since solution exists
         return null;
     }
 }

0023_Merge_k_Sorted_Lists.java

@@ -51,7 +51,8 @@ private ListNode merge2Lists(ListNode first, ListNode second) {
 
 
     //////////////////////////////////// SECOND APPROACH
-    public ListNode mergeKLists__approach2(ListNode[] lists) {
+    /*
+    public ListNode mergeKLists(ListNode[] lists) {
 
         // create a list object for merged lists
         ListNode head = null;
@@ -92,4 +93,5 @@ public ListNode mergeKLists__approach2(ListNode[] lists) {
         
         return head;
     }
+    */
 }