TASK DEFINITION: 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: [488, 495, 268, 140, 130, 379, 67, 298, 407, 250, 449, 74, 499, 465, 66, 426, 215, 43, 251, 374]

SOLUTION: [488, 495, 268, 140, 130, 379, 67, 298, 407, 250, 449, 74, 43, 465, 66, 426, 215, 499, 251, 374]

PROBLEM: [77, 481, 445, 178, 275, 58, 42, 168, 92, 136, 390, 498, 133, 333, 396, 85, 243, 283, 323, 322]

SOLUTION: [77, 481, 445, 178, 275, 58, 498, 168, 92, 136, 390, 42, 133, 333, 396, 85, 243, 283, 323, 322]

PROBLEM: [76, 66, 180, 140, 291, 342, 333, 13, 343, 279, 206, 292, 290, 275, 398, 258, 139, 271, 236, 21]

SOLUTION:
[76, 66, 180, 140, 291, 342, 333, 398, 343, 279, 206, 292, 290, 275, 13, 258, 139, 271, 236, 21]