Python Concise solution 100% Faster and 100% less memory usage (3-liner)
First of all, we need to find the absolute difference in the sum of the array and the goal to find the total sum of the values that are to be added in it. Then 
First of all, we need to find the absolute difference in the sum of the array and the goal to find the total sum of the values that are to be added in it. Then we simply find the ceiling value of the absolute difference divided by the limit. Using the if else condtion instead of math.floor makes the code faster .\n\n```\nclass Solution:\n    def minElements(self, nums: List[int], limit: int, goal: int) -> int:\n        x=sum(nums)\n        x=abs(x-goal)\n        return x//limit + (1 if x%limit!=0 else 0)\n
['Greedy', 'Python']