HackerRank Left Rotation solution in C/C++

  Left Rotation in Array 

A left rotation operation on an array of size  shifts each of the array's elements  unit to the left. Given an integer, , rotate the array that many steps left and return the result.

Example

After  rotations, .

Function Description

Complete the rotateLeft function in the editor below.

rotateLeft has the following parameters:

  • int d: the amount to rotate by
  • int arr[n]: the array to rotate

Returns

  • int[n]: the rotated array

Input Format

The first line contains two space-separated integers that denote , the number of integers, and , the number of left rotations to perform.
The second line contains  space-separated integers that describe .

Constraints

Sample Input

5 4
1 2 3 4 5

Sample Output

5 1 2 3 4

Explanation

To perform  left rotations, the array undergoes the following sequence of changes:


Solution: C/C++ code 


#include<stdio.h>

int main()

{

    int i=0;

    int siz,z=0;

    int rot;

    scanf("%d %d",&siz,&rot);

    //if(siz>100000 || siz<=0)

    //exit(0);

    //if(rot>siz || rot<=0)

    //exit(0);

    int arr[siz];

    for(i=0;i<siz;i++)

    {

        scanf("%d",&arr[i]);

        //if(arr[i]>1000000 || arr[i]<=0)

        //exit(0);

    }

    for (int i = 0; i < siz; i++)

    {

        printf("%d ", arr[(i + rot) % siz]);    

    }

} 

Comments

Post a Comment

Popular posts from this blog

Tree: Huffman Decoding Solution in C/C++

Image
  Tree: Huffman Decoding Solution in C/C++. Huffman coding  assigns variable length codewords to fixed length input characters based on their frequencies. More frequent characters are assigned shorter codewords and less frequent characters are assigned longer codewords. All edges along the path to a character contain a code digit. If they are on the left side of the tree, they will be a  0  (zero). If on the right, they'll be a  1  (one). Only the leaves will contain a letter and its frequency count. All other nodes will contain a null instead of a character, and the count of the frequency of all of it and its descendant characters. For instance, consider the string  ABRACADABRA . There are a total of   characters in the string. This number should match the count in the ultimately determined root of the tree. Our frequencies are   and  . The two smallest frequencies are for   and  , both equal to  , so we'll...
Read more

HackerRank Sparse Arrays solution in C/C++

 Sparse Arrays   There is a collection of input strings and a collection of query strings. For each query string, determine how many times it occurs in the list of input strings. Return an array of the results. Example There are   instances of ' ,   of ' ' and   of ' '. For each query, add an element to the return array,  . Function Description Complete the function  matchingStrings  in the editor below. The function must return an array of integers representing the frequency of occurrence of each query string in  strings . matchingStrings has the following parameters: string strings[n]  - an array of strings to search string queries[q]  - an array of query strings Returns int[q]:  an array of results for each query Input Format The first line contains and integer  , the size of  . Each of the next   lines contains a string  . The next line contains  , the size of  . Each of the...
Read more

HackerRank Array Manipulation solution in C/C++

  Array Manipulation   Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in the array. Example Queries are interpreted as follows: a b k 1 5 3 4 8 7 6 9 1 Add the values of   between the indices   and   inclusive: index -> 1 2 3 4 5 6 7 8 9 10 [ 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ] [ 3 , 3 , 3 , 3 , 3 , 0 , 0 , 0 , 0 , 0 ] [ 3 , 3 , 3 , 10 , 10 , 7 , 7 , 7 , 0 , 0 ] [ 3 , 3 , 3 , 10 , 10 , 8 , 8 , 8 , 1 , 0 ] The largest value is   after all operations are performed. Function Description Complete the function  arrayManipulation  in the editor below. arrayManipulation has the following parameters: int n  - the number of elements in the array int queries[q][3]  - a two dimension...
Read more