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.
One example: [1,45,67,43,58,98,41,34,57]
Solution is here: [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.

Now, solve this: [190, 62, 334, 175, 454, 358, 25, 495, 109, 282, 346, 244, 150, 96, 341, 128, 431, 120, 238, 416]
Solution:
[190, 62, 334, 175, 454, 358, 495, 25, 109, 282, 346, 244, 150, 96, 341, 128, 431, 120, 238, 416]