View difference between Paste ID: CahJ08eG and hv6ejyib

 // Author : Saurav Kalsoor
-// Basket Full of Balls - JAVA
+// String Transformations - JAVA
 
 
 import java.util.*;
 
 public class Test {
-
+
-    static Scanner sc = new Scanner(System.in);
+	static Scanner sc = new Scanner(System.in);
 	public static void main(String[] args) {
-    public static void main(String[] args) {
+		int n = sc.nextInt();
-    	int n = sc.nextInt();
+
 
 		String str = sc.next();
-		ArrayList<Integer> arr = new ArrayList<>();
+
-		for(int i=0; i < n ;i++){
+
-			arr.add(sc.nextInt());
+		System.out.println(stringTransformations(n, k, str));
 	}
 
-		System.out.println(bucketFullOfBalls(n, k, arr));
+	public static int stringTransformations(int n, int k, String s){
-    }
+		char[] str = s.toCharArray();
 		int first = -1, last = -1;
-	public static int bucketFullOfBalls(int n, int k, ArrayList<Integer> arr){
+		for(int i = 0;i < n; i++){
-		HashMap<Integer, Integer> count = new HashMap<>();
+			if(str[i] == '1'){
-		for(int x : arr){
+				if(first == -1){
-			count.put(x, count.getOrDefault(x, 0) + 1);
+					first = i;
 				}else{
 					last = i;
-		ArrayList<Integer> temp = new ArrayList<>();
+				}
-		for(Map.Entry<Integer, Integer> m : count.entrySet()){
+			}
-			if(m.getValue() >= k){
+
-				temp.add(m.getKey());
+
 		if(first == -1){
 			return 0;
 		}else if(last == -1){
-		int m = temp.size();
+			return 1;
-		if(m == 0){
+
-			return -1;
+
 		int count = 2;
 		str[first] = '2';
 		str[last] = '2';
 
-		int l = temp.get(0), r = l, i = 1;
+		int prevChanged = first;
-		while(i < m){
+
-			int j = i - 1;
+		while(prevChanged < last){
-			while(i < m && temp.get(i) == temp.get(i-1) + 1){
+
-				i++;
+			if(last - prevChanged <= k)
 				return count;
-			i--;
+
 			int i = -1;
-			if(temp.get(i) - temp.get(j) > r - l){
+			for(int j = prevChanged+1; j <= Math.min(n - 1, (prevChanged + k)); j++){
-				l = temp.get(j);
+				if(str[j] == '1'){
-				r = temp.get(i);
+					i = j;
 				}
 			}
-			i+=2;
+
 			if(i == -1){
 				return -1;
-		return r - l;
+
 
 			prevChanged = i;
 			str[prevChanged] = '2';
 			count++;
 
 		}
 
 		return count;
 	}
 
 }