added Kadanes's Algorithm

Author: saihariG

Arrays/KadanesAlgorithm.java

@@ -0,0 +1,24 @@
+package Arrays;
+
+public class KadanesAlgorithm {
+    // maximum subArray or Kadane's Algorithm
+    public int maxSubArray(int[] nums) {
+
+        int maxSum = nums[0];
+        int currSum = maxSum;
+
+        for(int i = 1 ; i < nums.length ; i++) {
+
+            if(currSum + nums[i] < nums[i]) {
+                currSum = nums[i];
+            }else {
+                currSum = currSum + nums[i];
+            }
+
+            if(currSum > maxSum) {
+                maxSum = currSum;
+            }
+        }
+        return maxSum;
+    }
+}

LinkedList/SinglyLinkedList.java

@@ -317,7 +317,6 @@ static boolean compareLists(ListNode head1, ListNode head2) {
     }
 
     public static ListNode removeDuplicates(ListNode head) {
-
         // if list is empty or if list contains a single node
         if(head == null || head.next == null){
             return head;
@@ -328,14 +327,13 @@ public static ListNode removeDuplicates(ListNode head) {
 
         // if head's next is null, it's the end of list
         while(head.next!=null){
-            // checking head's data with it's next data
+            // checking head's data with its next data
             if(head.data != head.next.data){
                 head = head.next;
             }else{
                 head.next = head.next.next;
             }
         }
-
         return current;
     }