Added 2 solutions in Contest 105

varunu28 · varunu28 · commit c5e7e446ee3d · 2018-10-07T11:37:54.000-07:00
diff --git a/Contests/Weekly Contest 105/Maximum Sum Circular Subarray.java b/Contests/Weekly Contest 105/Maximum Sum Circular Subarray.java
@@ -0,0 +1,28 @@
+class Solution {
+    public static  int maxSubarraySumCircular(int[] A) {
+        int max = kadane(A);
+        int wrap = 0;
+        
+        for(int i=0; i < A.length; i++) {
+            wrap = wrap+A[i];
+            A[i] *= -1;
+        }
+        
+        wrap = wrap + kadane(A);
+        
+        return Math.abs(wrap) < Math.abs(max) ? max : wrap;
+    }
+
+
+    private static int kadane(int[] a){
+        int maxSoFar=a[0];
+        int maxGlobal =a[0];
+        
+        for(int i=1; i<a.length; i++) {
+            maxSoFar = Math.max(a[i], maxSoFar + a[i]);
+            maxGlobal =Math.max(maxGlobal, maxSoFar);
+        }
+        
+        return maxGlobal;
+    }
+}
diff --git a/Contests/Weekly Contest 105/Reverse Only Letters.java b/Contests/Weekly Contest 105/Reverse Only Letters.java
@@ -0,0 +1,30 @@
+class Solution {
+    public static String reverseOnlyLetters(String S) {
+        char[] chars = S.toCharArray();
+        int start = 0;
+        int end = chars.length - 1;
+
+        while (start < end) {
+            if (Character.isLetter(chars[start]) && Character.isLetter(chars[end])) {
+                char temp = chars[start];
+                chars[start] = chars[end];
+                chars[end] = temp;
+
+                start++;
+                end--;
+            }
+            else if (Character.isLetter(chars[start]) && !Character.isLetter(chars[end])) {
+                end--;
+            }
+            else if (!Character.isLetter(chars[start]) && Character.isLetter(chars[end])) {
+                start++;
+            }
+            else {
+                start++;
+                end--;
+            }
+        }
+
+        return String.valueOf(chars);
+    }
+}
