Given a linked list, swap every two adjacent nodes and return its head in codechef code example

Example: # get the largest number in a list and print its indexes

numbers = 1,3,11,42,12,4001
highestnumber = -999
for i in numbers:
  if i > highestnumber:
    highestnumber = i
print(numbers.index(highestnumber))