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.
See one example below:
Problem: [1,45,67,43,58,98,41,34,57]
Solution: [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.

Problem: [74, 53, 246, 327, 356, 92, 456, 452, 29, 209, 396, 463, 210, 324, 225, 89, 286, 122, 437, 118]
Solution:
[74, 53, 246, 327, 356, 92, 456, 452, 463, 209, 396, 29, 210, 324, 225, 89, 286, 122, 437, 118]