Added 2 solutions

varunu28 · varunu28 · commit 549d555d25da · 2019-09-11T08:25:36.000-07:00
diff --git a/Easy/Count Substrings with Only One Distinct Letter.java b/Easy/Count Substrings with Only One Distinct Letter.java
@@ -0,0 +1,16 @@
+class Solution {
+    public int countLetters(String S) {
+        int count = 0;
+        int result = 1;
+        for (int i = 1; i < S.length(); i++) {
+            if (S.charAt(i) == S.charAt(i- 1)) {
+                result++;
+            }
+            else {
+                count += (result * (result + 1)) / 2;
+                result = 1;
+            }
+        }
+        return count + (result * (result + 1)) / 2;
+    }
+}
diff --git a/Easy/Distance Between Bus Stops.java b/Easy/Distance Between Bus Stops.java
@@ -0,0 +1,31 @@
+class Solution {
+    public int distanceBetweenBusStops(int[] distance, int start, int destination) {
+        if (start == destination) {
+            return 0;
+        }
+        int n = distance.length;
+        int actualStart = Math.min(start, destination);
+        int actualDestination = Math.max(start, destination);
+        return Math.min(
+            getStraightDistance(distance, actualStart, actualDestination, n), 
+            getReverseDistance(distance, actualDestination, actualStart, n)
+        );
+    }
+    
+    private int getStraightDistance(int[] distance, int start, int end, int n) {
+        int dist = 0;
+        while (start != end) {
+            dist += distance[start++];
+        }
+        return dist;
+    }
+    
+    private int getReverseDistance(int[] distance, int end, int start, int n) {
+        int dist = 0;
+        while (end != start) {
+            dist += distance[end++];
+            end = end % n;
+        }
+        return dist;
+    }
+}
