EASY to understand @beats 90-100%
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n  first find total sum 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n  first find total sum and check that if diffrence between goal and sum is divisible by limit if it divisible means we required the number of additional number equal to our quotient else it equal to quotient+1.\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n  O(N)\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n  O(1)\n# Code\n```\nclass Solution {\npublic:\n  \n    int minElements(vector<int>& nums, int limit, int goal) {\n        long long  sum=0;long int count=0;\n       for(int i=0;i<nums.size();i++)\n       {\n           sum=sum+nums[i];\n       }\n          long long  req=goal-sum;\n          if(abs(req)%abs(limit)!=0)\n           count=1;\n          count=count+abs(req)/abs(limit);\n            \n          return count;\n    }\n};\n```
['C++']