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: [307, 396, 130, 427, 133, 98, 211, 373, 108, 445, 372, 386, 278, 200, 483, 264, 101, 114, 84, 44]

SOLUTION: [307, 396, 130, 427, 133, 98, 211, 373, 108, 445, 372, 386, 278, 200, 44, 264, 101, 114, 84, 483]

PROBLEM: [140, 445, 344, 121, 328, 36, 73, 139, 244, 416, 309, 192, 319, 134, 412, 93, 195, 355, 76, 279]

SOLUTION: [140, 36, 344, 121, 328, 445, 73, 139, 244, 416, 309, 192, 319, 134, 412, 93, 195, 355, 76, 279]

PROBLEM: [33, 439, 485, 138, 228, 443, 339, 421, 118, 21, 215, 182, 220, 265, 186, 153, 160, 43, 213, 256]

SOLUTION:
[33, 439, 21, 138, 228, 443, 339, 421, 118, 485, 215, 182, 220, 265, 186, 153, 160, 43, 213, 256]

