Handle edge cases first: Check if the divisor is 0 (return 0), if the dividend is the minimum 32-bit integer and the divisor is -1 (return `2^31 - 1`), or if the dividend is 0 (return 0).

Determine the sign of the result by checking if the dividend and divisor have opposite signs (use XOR operation). Work with absolute values of the dividend and divisor to simplify the bit-shifting logic.

Use a loop to subtract the divisor from the dividend in a way that leverages bit shifting: Double the divisor (using left shift) until it exceeds the remaining dividend, then subtract the largest doubled divisor and add the corresponding power of 2 to the quotient. Repeat until the remaining dividend is less than the original divisor.