Merge pull request #14 from Rohithv07/6Aug

practice session

Author: Rohithv07

CodeForces/Contests/CodeforceContestes/src/contests/BogoSort.java

@@ -0,0 +1,40 @@
+package contests;
+
+import java.util.Arrays;
+import java.util.Scanner;
+
+/**
+ * @author rohithvazhathody 08-Aug-2025
+ */
+public class BogoSort {
+
+	/**
+	 * @param args
+	 */
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		int test = sc.nextInt();
+		while (test-- > 0) {
+			int n = sc.nextInt();
+			int[] nums = new int[n];
+			for (int index = 0; index < n; index++) {
+				nums[index] = sc.nextInt();
+			}
+			int[] shuffled = findShuffled(nums, n);
+			for (int index = n - 1; index >= 0; index--) {
+				System.out.print(shuffled[index] + " ");
+			}
+			System.out.println();
+		}
+		sc.close();
+	}
+
+	private static int[] findShuffled(int[] nums, int n) {
+		if (n == 1) {
+			return nums;
+		}
+		Arrays.sort(nums);
+		return nums;
+	}
+
+}

CodeForces/Contests/CodeforceContestes/src/contests/FairNumbers.java

@@ -0,0 +1,47 @@
+package contests;
+
+import java.util.Scanner;
+
+/**
+ * @author rohithvazhathody 06-Aug-2025
+ */
+public class FairNumbers {
+
+	/**
+	 * @param args
+	 */
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		int test = sc.nextInt();
+		while (test-- > 0) {
+			long num = sc.nextLong();
+			System.out.println(findMinNumber(num));
+		}
+		sc.close();
+	}
+
+	private static long findMinNumber(long num) {
+		if (num == 1) {
+			return num;
+		}
+  while (true) {
+   if (isDivisible(num)) {
+    return num;
+   }
+   num++;
+  }
+	}
+
+	private static boolean isDivisible(long num) {
+		long store = num;
+		while (num > 0) {
+			long digit = num % 10;
+			if (digit != 0 && store % digit != 0) {
+				return false;
+			}
+			num /= 10;
+		}
+		return true;
+	}
+
+}

CodeForces/Contests/CodeforceContestes/src/contests/JohnnyAndAncientComputer.java

@@ -0,0 +1,52 @@
+package contests;
+
+import java.util.Scanner;
+
+/**
+ * @author rohithvazhathody 08-Aug-2025
+ */
+public class JohnnyAndAncientComputer {
+
+	/**
+	 * @param args
+	 */
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		int test = sc.nextInt();
+		while (test-- > 0) {
+			long num1 = sc.nextLong();
+			long num2 = sc.nextLong();
+			int minOperations = findMinimumOperation(num1, num2);
+			System.out.println(minOperations);
+		}
+		sc.close();
+	}
+
+	private static int findMinimumOperation(long num1, long num2) {
+		if (num1 == num2) {
+			return 0;
+		}
+		long firstNum = num1;
+		long secondNum = num2;
+		while (firstNum % 2 == 0) {
+			firstNum /= 2;
+		}
+		while (secondNum % 2 == 0) {
+			secondNum /= 2;
+		}
+		if (firstNum != secondNum) {
+			return -1;
+		}
+		num1 /= firstNum;
+		num2 /= secondNum;
+		int power1 = (int) (Math.log(num1) / Math.log(2));
+		int power2 = (int) (Math.log(num2) / Math.log(2));
+		int operation = findCeil(Math.abs(power2 - power1), 3);
+		return operation;
+	}
+
+	private static int findCeil(int a, int b) {
+		return (a + b - 1) / (b);
+	}
+
+}

CodeForces/Contests/CodeforceContestes/src/contests/MoveBrackets.java

@@ -0,0 +1,40 @@
+package contests;
+
+import java.util.Scanner;
+import java.util.Stack;
+
+/**
+ * @author rohithvazhathody 07-Aug-2025
+ */
+public class MoveBrackets {
+
+	/**
+	 * @param args
+	 */
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		int test = sc.nextInt();
+		while (test-- > 0) {
+			int n = sc.nextInt();
+			String s = sc.next();
+			int findMinMove = findMinMove(s, n);
+			System.out.println(findMinMove);
+		}
+		sc.close();
+	}
+
+	private static int findMinMove(String s, int n) {
+		Stack<Character> stack = new Stack<>();
+		for (char ch : s.toCharArray()) {
+			if (ch == '(') {
+				stack.push(')');
+			} else {
+				if (!stack.isEmpty() && stack.peek() == ')') {
+					stack.pop();
+				}
+			}
+		}
+		return stack.size();
+	}
+
+}

CodeForces/Contests/CodeforceContestes/src/contests/ReverseASubstring.java

@@ -0,0 +1,42 @@
+package contests;
+
+import java.util.Scanner;
+
+/**
+ * @author rohithvazhathody 08-Aug-2025
+ */
+public class ReverseASubstring {
+
+	/**
+	 * @param args
+	 */
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		int n = sc.nextInt();
+		String s = sc.next();
+		int[] pos = findSubstring(s, n);
+		if (pos == null) {
+			System.out.println("NO");
+		} else {
+			System.out.println("YES");
+			System.out.println(pos[0] + " " + pos[1]);
+		}
+		sc.close();
+	}
+
+	private static int[] findSubstring(String s, int n) {
+		char currentChar = s.charAt(0);
+		int currentIndex = 0;
+		for (int index = 1; index < n; index++) {
+			char nextChar = s.charAt(index);
+			if (currentChar > nextChar) {
+				return new int[] { currentIndex + 1, index + 1 };
+			} else {
+				currentChar = nextChar;
+				currentIndex = index;
+			}
+		}
+		return null;
+	}
+
+}