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.
def almostSorted(arr):
sortArr = sorted(arr)
swaps = []
for i in range(len(arr)):
if arr[i] != sortArr[i]:
swaps.append(i + 1)
if len(swaps) == 2:
print('yes')
print('swap',swaps[0],swaps[1])
else:
if len(arr) > 2:
reverse = [arr[i] for i in range(swaps[0] - 1, swaps[-1])]
if sorted(reverse) == reverse[::-1]:
print('yes')
print('reverse',swaps[0],swaps[-1])
else:
print('no')
return
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
An unexpected error occurred. Please try reloading the page. If problem persists, please contact support@hackerrank.com
Almost Sorted
You are viewing a single comment's thread. Return to all comments →
def almostSorted(arr): sortArr = sorted(arr) swaps = [] for i in range(len(arr)): if arr[i] != sortArr[i]: swaps.append(i + 1) if len(swaps) == 2: print('yes') print('swap',swaps[0],swaps[1]) else: if len(arr) > 2: reverse = [arr[i] for i in range(swaps[0] - 1, swaps[-1])] if sorted(reverse) == reverse[::-1]: print('yes') print('reverse',swaps[0],swaps[-1]) else: print('no') return