2 Python self-understandable solutions [ Slight change to "Leetcode 462" i.e. Minimum moves problem]
NOTE : Both solutions are in O(n) time complexity and O(n) space complexity\n\nThe aim of this post is to showcase "different" types of approaches.\n\nSolution 
NOTE : Both solutions are in O(n) time complexity and O(n) space complexity\n\n*The aim of this post is to showcase "different" types of approaches.*\n\n**Solution 1** :\n```\nclass Solution:\n    def minOperations(self, n: int) -> int:\n        # Method 1 : Median\n        nums = []\n        for i in range(n):\n            nums.append(2*i + 1)\n        median_ish = nums[len(nums)//2]\n        count = 0\n        \n        for i in nums:\n            count += abs(i - median_ish)\n        \n        return count//2\n        # we divided it by 2 because increment and decrement operation can be done\n        # at the same time\n```\n\n**Solution 2** :\n```\nclass Solution:\n    def minOperations(self, n: int) -> int:\n        # Method 2 : Using concept of median i.e. minimize the number of moves\n        nums = []\n        for i in range(n):\n            nums.append(2*i + 1)\n        start, end = 0, len(nums)-1\n        count = 0\n        \n        while(start < end):\n            count += abs(nums[end] - nums[start])\n            start += 1\n            end -= 1\n        \n        return count//2\n\t\t# we divided it by 2 because increment and decrement operation can be done\n        # at the same time\n  ```\n*  Second approach explanantion :\nSuppose we\'ve an array [1,3,5,7,9]\nResultant array would be suppose [x,x,x,x,x] where x could be any element such that it proposes the property of median (neither left skewdness nor right skewdness).\n\nNow, 1 + a = x = 9 - b\nwhere, a and b denotes number to be subtracted/added in order to get desired element i.e x\nSo, 1 + a = 9 - b\n\t  a + b = 8 i.e. subtract elements from extreme ends\n\t  \nTherefore, to minimze the value of a+b (call it moves) , we\'ve to first sort in increasing order and subtract elements at extreme ends and later, divided the number of moves by 2 because we are performing increment and decrement operation at the same time.\n\n\n*That\'s the main crux of 2nd approach.*\n\n**Thank You.**\n
['Array', 'Python', 'Python3']