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.
Example: [1,45,67,43,58,98,41,34,57]
Example solution: [98,45,67,43,58,1,41,34,57]
Example explanation: 1 is the minimum element and 98 is the maximum element and their positions are swapped in the resulting list.

Problem: [420, 59, 180, 32, 111, 494, 38, 282, 435, 432, 147, 422, 414, 260, 51, 332, 343, 207, 362, 474]

Show your work and conclude with the exact phrasing "Therefore, the final answer is [answer]." where [answer] is just the final number or expression that solves the problem.
user
Solution: [420, 59, 180, 494, 111, 32, 38, 282, 435, 432, 147, 422, 414, 260, 51, 332, 343, 207, 362, 474]