easiest solution without any complexities (beginner friendly) added comments for readability.
Intuition\n Describe your first thoughts on how to solve this problem. \n- sort the nums\n# Approach\n Describe your approach to solving the problem. \neasiest 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n- sort the nums\n# Approach\n<!-- Describe your approach to solving the problem. -->\neasiest approach\n\n# Code\n```\nclass Solution:\n    def maxProductDifference(self, nums: List[int]) -> int:\n        nums.sort() # sort the list \n        temp1,temp2 = 0,0 # user two variables to store product\n        leng = len(nums) # find length of the nums\n        temp1 = nums[0] * nums[1] # get the product of first and second index\n        temp2  = nums[leng-1] * nums[leng-2] # get the product of last and 2nd last index\n        return temp2 - temp1 #\n```
['Python3']