Skip to main content

New Year Chaos HackerRank in Java | Programming Blog

New Year Chaos HackerRank solution in Java

New Year Chaos HackerRank in Java

It is New Year's Day and people are in line for the Wonderland rollercoaster ride. Each person wears a sticker indicating their initial position in the queue. Initial positions increment by 1 from 1 at the front of the line to n at the back.

Any person in the queue can bribe the person directly in front of them to swap positions. If two people swap positions, they still wear the same sticker denoting their original places in line. One person can bribe at most two others. For example, if n=8 and person5 bribes person4 the queue will look like this: 1,2,3,5,4,6,7,8.

Fascinated by this chaotic queue, you decide you must know the minimum number of bribes that took place to get the queue into its current state. If anyone has bribed more than two people, the line is too chaotic to compute the answer.

See full description in HackerRank :-

Solution 1

public class NewYearChaos {

    public static void main(String[] args) {
    
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter array size");
        int number = sc.nextInt();
        int[] array = new int[number];

        System.out.println("Enter array values");
        for (int i = 0; i < number; i++) {
            array[i] = sc.nextInt();
        }
    
        for (int i = 0; i < array.length; i++) {
            if ((i+2 < array.length) && (array[i] - i) > 3) {
                System.out.println("Too chaotic");
                return;
            }
        }
           
        int totalCount = 0;
        for (int i = array.length-1; i >= 0; i--) {
            for (int j = Math.max(0, array[i] - 2); j < i; j++) {
                if (array[j] > array[i]) {
                    totalCount++;
                }
            }
        }
        System.out.println(totalCount);
    }
    

Output :-
Enter array size
8
Enter array values
1 2 5 3 7 8 6 4
7
---------------------

Enter array size
8
Enter array values
5 1 2 3 7 8 6 4
Too chaotic

Solution 2

import java.util.Scanner;

public class NewYearChaos {

    public static void main(String[] args) {
    
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter array size");
        int number = sc.nextInt();
        int[] array = new int[number];

        System.out.println("Enter array values");
        for (int i = 0; i < number; i++) {
            array[i] = sc.nextInt();
        }
    
        int totalSwap = 0;
        for (int i = array.length-1; i>0 ; i--) {
            if (array[i] != i+1) {
                if (((i - 1) >= 0) && array[i - 1] == (i + 1)) {
                    totalSwap++;
                    swap(array, i, i - 1);
                } else if (((i - 2) >= 0) && array[i - 2] == (i + 1)) {
                    totalSwap += 2;
                    swap(array, i - 2, i - 1);
                    swap(array, i - 1, i);
                } else {
                    System.out.println("Too chaotic");
                    return;
                }
            }
        }
        System.out.println(totalSwap);
    }

    private static void swap(int[] array, int i, int j) {
        int temp = array[i];
        array[i] = array[j];
        array[j] = temp;
    }
}


Other HackerRank Problem and Solution :-

Comments

Popular posts from this blog

Plus Minus HackerRank Solution in Java | Programming Blog

Java Solution for HackerRank Plus Minus Problem Given an array of integers, calculate the ratios of its elements that are positive , negative , and zero . Print the decimal value of each fraction on a new line with 6 places after the decimal. Example 1 : array = [1, 1, 0, -1, -1] There are N = 5 elements, two positive, two negative and one zero. Their ratios are 2/5 = 0.400000, 2/5 = 0.400000 and 1/5 = 0.200000. Results are printed as:  0.400000 0.400000 0.200000 proportion of positive values proportion of negative values proportion of zeros Example 2 : array = [-4, 3, -9, 0, 4, 1]  There are 3 positive numbers, 2 negative numbers, and 1 zero in array. Following is answer : 3/6 = 0.500000 2/6 = 0.333333 1/6 = 0.166667 Lets see solution Solution 1 import java.io.*; import java.math.*; import java.security.*; import java.text.*; import java.util.*; import java.util.concurrent.*; import java.util.function.*; import java.util.regex.*; import java.util.stream.*; import static java.util.st

Flipping the Matrix HackerRank Solution in Java with Explanation

Java Solution for Flipping the Matrix | Find Highest Sum of Upper-Left Quadrant of Matrix Problem Description : Sean invented a game involving a 2n * 2n matrix where each cell of the matrix contains an integer. He can reverse any of its rows or columns any number of times. The goal of the game is to maximize the sum of the elements in the n *n submatrix located in the upper-left quadrant of the matrix. Given the initial configurations for q matrices, help Sean reverse the rows and columns of each matrix in the best possible way so that the sum of the elements in the matrix's upper-left quadrant is maximal.  Input : matrix = [[1, 2], [3, 4]] Output : 4 Input : matrix = [[112, 42, 83, 119], [56, 125, 56, 49], [15, 78, 101, 43], [62, 98, 114, 108]] Output : 119 + 114 + 56 + 125 = 414 Full Problem Description : Flipping the Matrix Problem Description   Here we can find solution using following pattern, So simply we have to find Max of same number of box like (1,1,1,1). And last