HACKER RANK - ARRAYS - ARRAY LEFT ROTATION

ARRAY LEFT ROTATION:

A left rotation operation on an array shifts each of the array's elements unit to the left. For example, if left rotations are performed on array , then the array would become . Note that the lowest index item moves to the highest index in a rotation. This is called a circular array.

Given an array of integers and a number, , perform left rotations on the array. Return the updated array to be printed as a single line of space-separated integers.

Function Description

Complete the function rotLeft in the editor below.

rotLeft has the following parameter(s):

int a[n]: the array to rotate
int d: the number of rotations

Returns

int a'[n]: the rotated array

Input Format

The first line contains two space-separated integers and , the size of and the number of left rotations.
The second line contains space-separated integers, each an .

Constraints

Sample Input

5 4
1 2 3 4 5

Sample Output

5 1 2 3 4

Solution

//python

def rotLeft(a, d):
    # Write your code here
    d=d%len(a)
    a=a[d:]+a[:d]
    return a

if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    first_multiple_input = input().rstrip().split()

    n = int(first_multiple_input[0])

    d = int(first_multiple_input[1])

    a = list(map(int, input().rstrip().split()))

    result = rotLeft(a, d)

    fptr.write(' '.join(map(str, result)))
    fptr.write('\n')

    fptr.close()

Comments

POST ORDER TRAVERSAL -- HACKERRANK SOLUTIONS

Complete the function in the editor below. It received parameter: a pointer to the root of a binary tree. It must print the values in the tree's postorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the function. Constraints Nodes in the tree Output Format Print the tree's postorder traversal as a single line of space-separated values. Sample Input 1 \ 2 \ 5 / \ 3 6 \ 4 Sample Output 4 3 6 5 2 1 Explanation The postorder traversal is shown. Solution #include < stdio.h > #include < string.h > #include < math.h > #include < stdlib.h > struct node { int data; struct node *left; struct node *ri...

HACKERRANK -- DELETE A NODE AT A GIVEN POSITION

HACKERRANK -- DELETE A NODE AT A GIVEN POSITION Delete the node at a given position in a linked list and return a reference to the head node. The head is at position 0. The list may be empty after you delete the node. In that case, return a null value. Example After removing the node at position , . Function Description Complete the deleteNode function in the editor below. deleteNode has the following parameters: - SinglyLinkedListNode pointer llist: a reference to the head node in the list - int position: the position of the node to remove Returns - SinglyLinkedListNode pointer: a reference to the head of the modified list Input Format The first line of input contains an integer , the number of elements in the linked list. Each of the next lines contains an integer, the node data values in order. The last line contains an integer, , the position of the node to delete. Constraints , wh...

TREE PREORDER TRAVERSAL -- HACKERRANK SOLUTIONS

Complete the function in the editor below, which has parameter: a pointer to the root of a binary tree. It must print the values in the tree's preorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the preOrder function. Constraints Nodes in the tree Output Format Print the tree's preorder traversal as a single line of space-separated values. Sample Input 1 \ 2 \ 5 / \ 3 6 \ 4 Sample Output 1 2 5 3 4 6 Explanation The preorder traversal of the binary tree is printed. Solution #include < stdio.h > #include < string.h > #include < math.h > #include < stdlib.h > struct node { int data; struct node *left; struct ...

TECHY PINK

Search This Blog