View difference between Paste ID: 6yKYSEws and CahJ08eG

 // Author : Saurav Kalsoor
-// String Transformations - JAVA
+// String Transformations - KOTLIN
 
 
-import java.util.*;
+import java.util.*
-
+
-public class Test {
+var sc = Scanner(System.`in`)
-
+
-	static Scanner sc = new Scanner(System.in);
+fun main() {
-	public static void main(String[] args) {
+    val n = sc.nextInt()
-		int n = sc.nextInt();
+    val k = sc.nextInt()
-		int k = sc.nextInt();
+    val str = sc.next()
     println(stringTransformations(n, k, str))
-		String str = sc.next();
+
-
+
-
+fun stringTransformations(n: Int, k: Int, s: String): Int {
-		System.out.println(stringTransformations(n, k, str));
+    val str = s.toCharArray()
-	}
+    var first = -1
-
+    var last = -1
-	public static int stringTransformations(int n, int k, String s){
+    for (i in 0 until n) {
-		char[] str = s.toCharArray();
+        if (str[i] == '1') {
-		int first = -1, last = -1;
+            if (first == -1) {
-		for(int i = 0;i < n; i++){
+                first = i
-			if(str[i] == '1'){
+            } else {
-				if(first == -1){
+                last = i
-					first = i;
+            }
-				}else{
+        }
-					last = i;
+    }
-				}
+    if (first == -1) {
-			}
+        return 0
-		}
+    } else if (last == -1) {
         return 1
-		if(first == -1){
+    }
-			return 0;
+    var count = 2
-		}else if(last == -1){
+    str[first] = '2'
-			return 1;
+    str[last] = '2'
-		}
+    var prevChanged = first
     while (prevChanged < last) {
-		int count = 2;
+        if (last - prevChanged <= k) return count
-		str[first] = '2';
+        var i = -1
-		str[last] = '2';
+        for (j in prevChanged + 1..Math.min(n - 1, prevChanged + k)) {
             if (str[j] == '1') {
-		int prevChanged = first;
+                i = j
             }
-		while(prevChanged < last){
+        }
         if (i == -1) {
-			if(last - prevChanged <= k)
+            return -1
-				return count;
+        }
-
+        prevChanged = i
-			int i = -1;
+        str[prevChanged] = '2'
-			for(int j = prevChanged+1; j <= Math.min(n - 1, (prevChanged + k)); j++){
+        count++
-				if(str[j] == '1'){
+    }
-					i = j;
+    return count
-				}
+}