We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
st = mid + 1
ed = n - 2
while(st <= ed):
a[st], a[ed] = a[ed], a[st]
st = st + 1
ed = ed - 1
for i in range (n):
if i == n-1:
print(a[i])
else:
print(a[i], end = ' ')
return
test_cases = int(input())
for cs in range (test_cases):
n = int(input())
a = list(map(int, input().split()))
findZigZagSequence(a, n)
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Zig Zag Sequence
You are viewing a single comment's thread. Return to all comments →
I see the same output and it still says wrong answer. I think there is a bug here.
This is my code, try it yourself.
def findZigZagSequence(a, n): a.sort() mid = int(n / 2) a[mid], a[n-1] = a[n-1], a[mid]
test_cases = int(input()) for cs in range (test_cases): n = int(input()) a = list(map(int, input().split())) findZigZagSequence(a, n)