Detailed Instructions: 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.
Problem:[190, 43, 71, 390, 182, 235, 154, 282, 493, 69, 468, 317, 489, 132, 336, 375, 160, 432, 163, 374]
Solution:
[190, 493, 71, 390, 182, 235, 154, 282, 43, 69, 468, 317, 489, 132, 336, 375, 160, 432, 163, 374]