solves save the prisoners

Author: anishLearnsToCode

src/ViralAdvertising.java

@@ -0,0 +1,22 @@
+// https://www.hackerrank.com/challenges/save-the-prisoner/problem
+
+package implimentation;
+
+import java.util.Scanner;
+
+public class SaveThePrisoner {
+    public static void main(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+        int queries = scanner.nextInt();
+        while (queries-- > 0) {
+            long prisoners = scanner.nextLong();
+            long sweets = scanner.nextLong();
+            long startIndex = scanner.nextLong();
+            System.out.println(unluckyPrisoner(prisoners, sweets, startIndex));
+        }
+    }
+
+    private static long unluckyPrisoner(long prisoners, long sweets, long startIndex) {
+        return ((startIndex - 1) + sweets % prisoners - 1 + prisoners) % prisoners + 1;
+    }
+}

src/implimentation/SaveThePrisoner.java

@@ -4,38 +4,7 @@ public class test {
     private static final Scanner scanner = new Scanner(System.in);
 
     public static void main(String[] args) {
-        int length = scanner.nextInt();
-        int[] array = getArray(length);
-        int element = scanner.nextInt();
-        System.out.println(search(array, element));
-    }
-
-    // Binary Search that will return the exact or nearest smallest value if absent
-    // and -1 of item not found and no smaller value available
-    private static int search(int[] array, int element) {
-        int mid = array.length / 2;
-        for (int start = 0, end = array.length ; start <= end && mid < array.length && mid >= 0 ; mid = (start + end) / 2) {
-            if (array[mid] == element) {
-                return mid;
-            } else if (array[mid] < element) {
-                start = mid + 1;
-            } else {
-                end = mid - 1;
-            }
-        }
-
-        if (check(array, mid + 1, element)) {
-            return mid + 1;
-        } else if (check(array, mid, element)) {
-            return mid;
-        } else if (check(array, mid - 1, element)) {
-            return mid - 1;
-        }
-        return -1;
-    }
-
-    private static boolean check(int[] array, int index, int element) {
-        return index - 1 >= 0 && index - 1 < array.length && array[index] < element;
+        System.out.println(-1 % 2);
     }
 
     private static int[] getArray(int length) {