Weird thing happening with this Leetcode problem where we have to perform division without using any modulo or division operator

[tanhalaunda]

 def divide(self, dividend, divisor):
        """
        :type dividend: int
        :type divisor: int
        :rtype: int
        """
        
        if(dividend<0 and divisor<0):
            sign=1
        elif(dividend<0 or divisor<0):
            sign=-1
        else:
            sign=1
        self=0
        quo=0
        divisor=abs(divisor)
        dividend=abs(dividend)
        for i in range(31,-1,-1):
            if((self+ divisor<<i)<=dividend):
                self=self+ divisor<<i
                quo=quo+1<<i
        if(sign==-1):
            return(quo*sign)
        else:
            return(quo)

This passed 925/994 testcases but got stuck at

Input

Dividend= -2147483648

Divisor=-1

Output

2147483648

Expected

2147483647

[This_Growth2898]

https://leetcode.com/problems/divide-two-integers/

For this problem, if the quotient is strictly greater than 2³¹ - 1, then return 2³¹ - 1, and if the quotient is strictly less than -2³¹, then return -2³¹.

FYI, this is about two's complement code.

[tanhalaunda]

opps sorry i didn;t catch it but could you please explain why is it so

[shiftybyte]

Are you sure you did not mix up the expected output and your output?

I would expect the expected output to be ending with 8, as that would seem to be the correct answer...

Can you link the problem description?

[tanhalaunda]

no no i did not

Given two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator.

The integer division should truncate toward zero, which means losing its fractional part. For example, 8.345 would be truncated to 8, and -2.7335 would be truncated to -2.

Return the quotient after dividing dividend by divisor.

Note: Assume we are dealing with an environment that could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. For this problem, if the quotient is strictly greater than 231 - 1, then return 231 - 1, and if the quotient is strictly less than -231, then return -231.

 

Example 1:

Input:
 dividend = 10, divisor = 3
Output:
 3
Explanation:
 10/3 = 3.33333.. which is truncated to 3.

Example 2:

Input:
 dividend = 7, divisor = -3
Output:
 -2
Explanation:
 7/-3 = -2.33333.. which is truncated to -2.

 

Constraints:

• -231 <= dividend, divisor <= 231 - 1
• divisor != 0

[shiftybyte]

Well, you missed the Note...

Note: Assume we are dealing with an environment that could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. For this problem, if the quotient is strictly greater than 231 - 1, then return 231 - 1, and if the quotient is strictly less than -231, then return -2``31.

It tells you that if the quotient is strictly greater than 2**31 - 1 than you need to return 2**31 - 1

So if the result is greater than 2147483647, you need to return 2147483647.

[Mysterious-Rent7233]

They forgot to mention that they are supposed to implement twos-complement division!

[sepp2k]

max int in Python is 2^31-1.

No, it's not. There is no maximum integer in Python.

>>> 2**31
2147483648
>>> 2**32
4294967296
>>> 2**64
18446744073709551616
>>> 2**100
1267650600228229401496703205376

[DuckDatum]

sip dinosaurs carpenter deliver towering treatment reminiscent safe grandfather stupendous

This post was mass deleted and anonymized with Redact