Practice>Data Structures>Arrays>Arrays - DS

hackerrank.com

Arrays - DS

Problem Link : https://www.hackerrank.com/challenges/arrays-ds/problem

Difficulty : Easy

 

Tip

• Very common problem :-) reversing array
• There few ways to solve
• Implementing reversing array by using reverse index -1
  • [a[(i+1)*-1] for i in range(len(a))]
• Simply call reversed(a)
• More simpler version is 'return a[::-1]'

 

Solution

#!/bin/python3 import math import os import random import re import sys # Complete the reverseArray function below. def reverseArray(a): ''' rtn = [] for i in range(len(a)): rtn.append(a[(i+1)*-1]) return rtn ''' #return reversed(a) #return a[::-1] return [a[(i+1)*-1] for i in range(len(a))] if __name__ == '__main__': fptr = open(os.environ['OUTPUT_PATH'], 'w') arr_count = int(input()) arr = list(map(int, input().rstrip().split())) res = reverseArray(arr) fptr.write(' '.join(map(str, res))) fptr.write('\n') fptr.close()