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.

Input: Consider Input: [266, 446, 112, 116, 14, 309, 407, 256, 27, 109, 13, 118, 448, 412, 135, 288, 270, 158, 189, 75]

Output: [266, 446, 112, 116, 14, 309, 407, 256, 27, 109, 448, 118, 13, 412, 135, 288, 270, 158, 189, 75]


Input: Consider Input: [142, 384, 19, 322, 397, 411, 65, 214, 114, 75, 52, 40, 122, 337, 350, 289, 42, 236, 91, 386]

Output: [142, 384, 411, 322, 397, 19, 65, 214, 114, 75, 52, 40, 122, 337, 350, 289, 42, 236, 91, 386]


Input: Consider Input: [224, 386, 364, 432, 468, 46, 205, 257, 308, 388, 261, 73, 402, 291, 403, 165, 147, 276, 222, 111]


Output: [224, 386, 364, 432, 46, 468, 205, 257, 308, 388, 261, 73, 402, 291, 403, 165, 147, 276, 222, 111]


