Minimum steps to destination GFG POTD Python Solution geeks for geeks problem of the day
Problem - https://www.geeksforgeeks.org/problem...
Given an infinite number line. You start at 0 and can go either to the left or to the right. The condition is that in the ith move, you must take i steps. Given a destination d, find the minimum number of steps required to reach that destination.
Example 1:
Input: d = 2
Output: 3
Explaination: The steps takn are +1, -2 and +3.
Example 2:
Input: d = 10
Output: 4
Explanation: The steps are +1, +2, +3 and +4