Part 1. Definition
In this task, you are given a list of unique integers you need to swap the positions of maximum and minimum element in the list and return the updated list.
Part 2. Example
[1,45,67,43,58,98,41,34,57]
Answer: [98,45,67,43,58,1,41,34,57]
Explanation: 1 is the minimum element and 98 is the maximum element and their positions are swapped in the resulting list.
Part 3. Exercise
[31, 364, 162, 376, 36, 497, 64, 10, 403, 264, 166, 426, 308, 232, 95, 406, 33, 170, 40, 311]
Answer:
[31, 364, 162, 376, 36, 10, 64, 497, 403, 264, 166, 426, 308, 232, 95, 406, 33, 170, 40, 311]