Leetcode 29. Divide Two Integers

Divide two 32-bit signed integers without using multiplication, division, or modulo, returning the quotient truncated toward zero. Handle divisor != 0 and clamp to 32-bit bounds; the core challenge is computing the quotient efficiently (usually via sign handling and fast subtraction using bit shifts/doubling).