Skip to main content

Arrays Left Rotation in Java | HackerRank Solution

Arrays Left and Right Rotation in Java | HackerRank Solution for Array Left Rotation.

Arrays Left and Right Rotation in Java | HackerRank Solution for Array Left Rotation.

Example 1 :- Array Left Rotation by any given number in java (Approach 1)

import java.util.Arrays;
import java.util.Scanner;

public class ArraysLeftRotation {

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

        System.out.println("Enter values");
        int[] array = new int[sizeOfArray];
        for (int i = 0; i < sizeOfArray; i++) {
            array[i] = sc.nextInt();
        }

        System.out.println("Enter number of left rotation");
        int rotation = sc.nextInt();
               
        // Loop until given rotation
        for (int i = 0; i < rotation; i++) {
            
            // Store first array element into temp variable
            int tempVariable = array[0];
            
            // Loop through array and shift element by 1.
            for (int j = 0; j < array.length-1; j++) {
                array[j] = array[j + 1];
            }
            
            // Store 0th array element in last position.
            array[array.length - 1] = tempVariable;
        }
        
        System.out.println(Arrays.toString(array));

    }

Output :-
Enter size of Array
5
Enter values
1 2 3 4 5
Enter number of left rotation
2
[3, 4, 5, 1, 2]

_______________________

Enter size of Array
10
Enter values
1 2 3 4 5 6 7 8 9 0
Enter number of left rotation
5
[6, 7, 8, 9, 0, 1, 2, 3, 4, 5]


Example 2 :- Array Left Rotation by any given number in java (Approach 2)

import java.util.Arrays;
import java.util.Scanner;

public class ArraysLeftRotation {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
       
        Scanner sc = new Scanner(System.in);
       
        System.out.println("Enter size of Array");
        int sizeOfArray = sc.nextInt();
       
        System.out.println("Enter values");
        int[] array = new int[sizeOfArray];
        for (int i = 0; i < sizeOfArray; i++) {
            array[i] = sc.nextInt();
        }
       
        System.out.println("Enter number of left rotation");
        int rotation = sc.nextInt();

        int[] newArray = new int[sizeOfArray];
       
        for (int i = 0; i < sizeOfArray ; i++) {
            if (rotation + i < sizeOfArray) {
                newArray[i] = array[rotation+i];
            } else {
                newArray[i] = array[(i+rotation) % sizeOfArray];
            }
        }
       
        System.out.println(Arrays.toString(newArray));

    }
}


Example 3 :- Array Right Rotation by any given Number

import java.util.Arrays;
import java.util.Scanner;

public class ArraysLeftRotation {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
       
        Scanner sc = new Scanner(System.in);
       
        System.out.println("Enter size of Array");
        int sizeOfArray = sc.nextInt();
       
        System.out.println("Enter values");
        int[] array = new int[sizeOfArray];
        for (int i = 0; i < sizeOfArray; i++) {
            array[i] = sc.nextInt();
        }
       
        System.out.println("Enter number of left rotation");
        int rotation = sc.nextInt();

        for (int i = 0; i < rotation; i++) {
            int tempVariable = array[array.length-1];
           
            for (int j = array.length-1; j > 0; j--) {
                array[j] = array[j - 1];
            }
           
            array[0] = tempVariable;
        }
       
        System.out.println(Arrays.toString(array));

    }
}

Output :-
Enter size of Array
5
Enter values
1 2 3 4 5
Enter number of left rotation
2
[4, 5, 1, 2, 3]

_______________________

Enter size of Array
10
Enter values
1 2 3 4 5 6 7 8 9 0
Enter number of left rotation
4
[7, 8, 9, 0, 1, 2, 3, 4, 5, 6]


Check out other HackerRank problem's solution in Java :-

 


 

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