Given two integers dividend and divisor, return the quotient after dividing dividend by divisor.

The division result should be truncated toward zero.

You must not use multiplication, division, or modulo operators.

Note: Assume the result fits in a $32$-bit signed integer.

Constraints:

• $-2^{31} \leq$ dividend, divisor $\leq 2^{31} - 1$

• divisor != 0

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.