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: [117, 339, 458, 196, 352, 486, 260, 72, 55, 238, 395, 455, 33, 118, 142, 408, 348, 70, 379, 233]
Solution:
[117, 339, 458, 196, 352, 33, 260, 72, 55, 238, 395, 455, 486, 118, 142, 408, 348, 70, 379, 233]