Updated solutions

Author: ImAkshayad

java/arrays/ContainerWithMostWater.java

@@ -0,0 +1,21 @@
+class ContainerWithMostWater {
+    public int maxArea(int[] height) {
+        int max=Integer.MIN_VALUE;
+
+        int i=0,j=height.length-1;
+        while(i<j)
+        {
+            max=Math.max(Math.min(height[i],height[j]) * (j-i) , max);
+
+            if(height[i]<height[j]) i++;
+            else if(height[j] < height[i]) j--;
+            else if(height[i]==height[j])
+            {
+                i++;j--;
+            }
+            else
+                break;
+        }
+        return max;
+    }
+}

java/arrays/MajorityElement.java

@@ -0,0 +1,20 @@
+public class MajorityElement {
+    public int majorityElement(int[] nums) {
+        int count=1, majority=nums[0];
+
+        for(int i=1;i<nums.length;i++)
+        {
+            if(nums[i]==majority)
+                count++;
+            else
+                count--;
+
+            if(count==0)
+            {
+                count=1;
+                majority=nums[i];
+            }
+        }
+        return majority;
+    }
+}

java/arrays/TwoSum.java

@@ -0,0 +1,19 @@
+class TwoSum {
+    public int[] twoSum(int[] nums, int target) {
+        int i,j;
+        HashMap<Integer,Integer> cache=new HashMap<Integer,Integer>();
+        int[]  a = new int[2];
+        for(i = 0; i<nums.length; i++)
+        {
+            if(cache.containsKey(nums[i]))
+            {
+                a[0] = cache.get(nums[i]);
+                a[1] = i;
+                break;
+            }
+            else
+                cache.put(target-nums[i],i);
+        }
+        return a;
+    }
+}

java/linked_lists/MergeTwoLists.java

@@ -0,0 +1,26 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+class MergeTwoLists {
+    public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
+        if(list1==null) return list2;
+        if(list2==null) return list1;
+        if(list1.val<list2.val)
+        {
+            list1.next=mergeTwoLists(list1.next,list2);
+            return list1;
+        }
+        else
+        {
+            list2.next=mergeTwoLists(list1,list2.next);
+            return list2;
+        }
+    }
+}