Scribd Logo
Upload

Welcome to Scribd!

  • Developer Test01

    Uploaded by

    Long Cao
    10 views1 page
    The document describes a problem to reverse the digits of a 32-bit signed integer and return the result, handling overflow by returning 0 if the reversed number is outside the allowed range from -2^31 to (2^31)-1. It provides examples of reversing positive and negative integers as well as edge cases like 0. It specifies the problem constraints that the input integer will be in the range from -2^31 to (2^31)-1.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes a problem to reverse the digits of a 32-bit signed integer and return the result, handling overflow by returning 0 if the reversed number is outside the allowed range from -2^31 to (2^31)-1. It provides examples of reversing positive and negative integers as well as edge cases like 0. It specifies the problem constraints that the input integer will be in the range from -2^31 to (2^31)-1.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    10 views1 page

    Developer Test01

    Uploaded by

    Long Cao
    The document describes a problem to reverse the digits of a 32-bit signed integer and return the result, handling overflow by returning 0 if the reversed number is outside the allowed range from -2^31 to (2^31)-1. It provides examples of reversing positive and negative integers as well as edge cases like 0. It specifies the problem constraints that the input integer will be in the range from -2^31 to (2^31)-1.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    1.

    Reverse Integer

    Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go
    outside the signed 32-bit integer range [-231, 231 - 1], then return 0.

    Assume the environment does not allow you to store 64-bit integers (signed or unsigned).

    Example 1:

    Input: x = 123

    Output: 321

    Example 2:

    Input: x = -123

    Output: -321

    Example 3:

    Input: x = 120

    Output: 21

    Example 4:

    Input: x = 0

    Output: 0

    Constraints:

    • -231 <= x <= 231 - 1

    Content:

    - 10 mins to read the requirements


    - 10 mins to answer and clear the requirements
    - 15 mins to answer: the solution, complexity, the performance and why
    - 15 mins to write the code and test

    Run the code and submit.

    You might also like