InterviewBit Academy is now Scaler!
Learn Tech Skills from Scratch @ Scaler EDGE

Step by Step

Problem Description

Given a target A on an infinite number line, i.e. -infinity to +infinity.
You are currently at position 0 and you need to reach the target by moving according to the below rule:

  • In ith move you can take i steps forward or backward.
  • Find the minimum number of moves required to reach the target.

    Problem Constraints

    -109 <= A <= 109

    Input Format

    First and only argument is an integer A.

    Output Format

    Return an integer denoting the minimum moves to reach target.

    Example Input

    Input 1:


    Input 2:


    Example Output

    Output 1:


    Output 2:


    Example Explanation

    Explanation 1:

     On the first move we step from 0 to 1.
     On the second step we step from 1 to 3.

    Explanation 2:

     On the first move we step from 0 to 1.
     On the second move we step  from 1 to -1.
     On the third move we step from -1 to 2.

    NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.
    Start solving Step by Step on Interview Code Editor
    • Hint 1
    • Solution Approach
    • Complete Solution
    Asked In:


    Click here to start solving coding interview questions