Modified 2 solutions

varunu28 · varunu28 · commit b618289969c5 · 2020-09-10T07:51:37.000-05:00
diff --git a/Easy/Bulls and Cows.java b/Easy/Bulls and Cows.java
@@ -1,25 +1,20 @@
 class Solution {
   public String getHint(String secret, String guess) {
     int[] counter = new int[10];
-    int cows = 0;
+    for (Character c : secret.toCharArray()) {
+      counter[Character.getNumericValue(c)]++;
+    }
     int bulls = 0;
+    int cows = 0;
     for (int i = 0; i < guess.length(); i++) {
-      int s = Character.getNumericValue(secret.charAt(i));
-      int g = Character.getNumericValue(guess.charAt(i));
-      if (s == g) {
+      if (guess.charAt(i) == secret.charAt(i)) {
         bulls++;
       }
-      else {
-        if (counter[s] < 0) {
-          cows++;
-        }
-        if (counter[g] > 0) {
-          cows++;
-        }
-        counter[s]++;
-        counter[g]--;
+      if (counter[Character.getNumericValue(guess.charAt(i))] > 0) {
+        counter[Character.getNumericValue(guess.charAt(i))]--;
+        cows++;
       }
     }
-    return new StringBuilder().append(bulls).append("A").append(cows).append("B").toString();
+    return bulls + "A" + (cows - bulls) + "B";
   }
 }
diff --git a/Medium/Arithmetic Slices.java b/Medium/Arithmetic Slices.java
@@ -1,16 +1,17 @@
 class Solution {
-    public int numberOfArithmeticSlices(int[] A) {
-        
-        int curr = 0, sum = 0;
-        for (int i=2; i<A.length; i++)
-            if (A[i]-A[i-1] == A[i-1]-A[i-2]) {
-                curr += 1;
-                sum += curr;
-            } 
-            else {
-                curr = 0;
-            }
-
-        return sum;
+  public int numberOfArithmeticSlices(int[] A) {
+    int count = 0;
+    for (int i = 0; i < A.length - 2; i++) {
+      int diff = A[i + 1] - A[i];
+      for (int j = i + 2; j < A.length; j++) {
+        if (A[j] - A[j - 1] == diff) {
+          count++;
+        }
+        else {
+          break;
+        }
+      }
     }
+    return count;
+  }
 }
