Improved task 1785.

Author: javadev

src/main/java/g1701_1800/s1785_minimum_elements_to_add_to_form_a_given_sum/readme.md

@@ -1,25 +1,30 @@
-1784\. Check if Binary String Has at Most One Segment of Ones
+1785\. Minimum Elements to Add to Form a Given Sum
 
-Easy
+Medium
 
-Given a binary string `s` **without leading zeros**, return `true` _if_ `s` _contains **at most one contiguous segment of ones**_. Otherwise, return `false`.
+You are given an integer array `nums` and two integers `limit` and `goal`. The array `nums` has an interesting property that `abs(nums[i]) <= limit`.
+
+Return _the minimum number of elements you need to add to make the sum of the array equal to_ `goal`. The array must maintain its property that `abs(nums[i]) <= limit`.
+
+Note that `abs(x)` equals `x` if `x >= 0`, and `-x` otherwise.
 
 **Example 1:**
 
-**Input:** s = "1001"
+**Input:** nums = [1,-1,1], limit = 3, goal = -4
 
-**Output:** false
+**Output:** 2
 
-**Explanation:** The ones do not form a contiguous segment.
+**Explanation:** You can add -2 and -3, then the sum of the array will be 1 - 1 + 1 - 2 - 3 = -4. 
 
 **Example 2:**
 
-**Input:** s = "110"
+**Input:** nums = [1,-10,9,1], limit = 100, goal = 0
 
-**Output:** true
+**Output:** 1 
 
 **Constraints:**
 
-* `1 <= s.length <= 100`
-* `s[i]` is either `'0'` or `'1'`.
-* `s[0]` is `'1'`.
+* <code>1 <= nums.length <= 10<sup>5</sup></code>
+* <code>1 <= limit <= 10<sup>6</sup></code>
+* `-limit <= nums[i] <= limit`
+* <code>-10<sup>9</sup> <= goal <= 10<sup>9</sup></code>