You are standing at position 0 on an infinite number line.

There is a goal at position target. On each move, you can either go left or right. During the n-th move (Starting from 1), you take n steps. Return the minimum number of steps required to reach destination.

Input: target=3

Output: 2

NTar=abs(int(input('Target = '))) k=0 while NTar>0: k+=1 NTar-=k print(NTar) print(k if NTar%2==0 else k+1+k%2)

Input_1:

Target = 1

Output:

1

Input_2:

Target = 3

Output:

2

Input_3:

Target = 2

Output:

3

Exec. on linux

**Morae**!Q!

- Insert and Extend in list
- Interchange first and last number in list
- Print Odd Numbers in range
- Compare List in python
- Find whether the largest element in the array is at least twice as much as every other number in the array.
- Find
to reach the top of the floor**minimum cost** - Word Count in Python
- Lower case to upper case in python
- Display Time in python
- Sum of Odd And Even in Python
- Surface Area of Walls
- Find the sum of squares of individual digits
- Print the given series – 1 1 2 6 24
- Minimum number of steps required to reach destination.
- Seconds to Days Hours Minutes
- Program to remove add “Hyphen” character in the entered string
- Remove the nth Index Character from a Non-Empty String
- Relational operator Question
- Check whether all the given numbers lies in range of x and y.
- Find the Armstrong numbers between the given range.