View difference between Paste ID: 1pXhTvxz and hv6ejyib

 // Author : Saurav Kalsoor
-// Basket Full of Balls - JAVA
+// Shifting Compartments - 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();
+		int q = sc.nextInt();
-		int k = sc.nextInt();
+
 		String str = sc.next();
-		ArrayList<Integer> arr = new ArrayList<>();
+
-		for(int i=0; i < n ;i++){
+		ArrayList<Integer> l = new ArrayList<>();
-			arr.add(sc.nextInt());
+		ArrayList<Integer> r = new ArrayList<>();
 		ArrayList<Integer> k = new ArrayList<>();
 
-		System.out.println(bucketFullOfBalls(n, k, arr));
+		for(int i=0; i < q ;i++){
-    }
+			l.add(sc.nextInt());
 			r.add(sc.nextInt());
-	public static int bucketFullOfBalls(int n, int k, ArrayList<Integer> arr){
+			k.add(sc.nextInt());
-		HashMap<Integer, Integer> count = new HashMap<>();
+
-		for(int x : arr){
+
-			count.put(x, count.getOrDefault(x, 0) + 1);
+		System.out.println(shiftingCompartments(n, q, str, l, r, k));
 	}
 
-		ArrayList<Integer> temp = new ArrayList<>();
+	public static String shiftingCompartments(int n, int q, String s, ArrayList<Integer> l, ArrayList<Integer> r, ArrayList<Integer> k){
-		for(Map.Entry<Integer, Integer> m : count.entrySet()){
+		char[] str = s.toCharArray();
-			if(m.getValue() >= k){
+
-				temp.add(m.getKey());
+		for(int i=0; i < q; i++){
-			}
+			cycle(str, l.get(i), r.get(i), k.get(i));
 		}
 
-		int m = temp.size();
+		return String.valueOf(str);
-		if(m == 0){
+
-			return -1;
+
 	public static void myReverse(char[] str, int i, int j){
 		while(i < j){
 			char temp = str[i];
 			str[i] = str[j];
-		int l = temp.get(0), r = l, i = 1;
+			str[j] = temp;
-		while(i < m){
+			i++;
-			int j = i - 1;
+			j--;
-			while(i < m && temp.get(i) == temp.get(i-1) + 1){
+
-				i++;
+
-			}
+
-			i--;
+	public static void cycle(char[] str, int l, int r, int k){
 		int n = r-l+1;
-			if(temp.get(i) - temp.get(j) > r - l){
+		k = k%n;
-				l = temp.get(j);
+		myReverse(str, l, l+n-k-1);
-				r = temp.get(i);
+		myReverse(str, l+n-k, r);
-			}
+		myReverse(str, l, r);
 	}
-			i+=2;
+