Recursive Multiply Function | Dataford Interview Questions

In a ZoomInfo SalesOS interface, implement a utility that computes the product of two integers. Write recursive_multiply(a, b) using recursion, addition, subtraction, and bit operations, but do not use multiplication, division, modulo, or iteration.

Your implementation must support positive, negative, and zero values. To achieve logarithmic recursion depth, repeatedly halve the non-negative multiplier with a right shift and double the other operand. If the multiplier is odd, add one extra copy of the doubled operand to the result.

Formal Specification

Input: Two integers, a and b.
Output: The integer value of a multiplied by b.
Restrictions: Do not use *, /, %, loops, or built-in product functions.

Constraints

-10^9 <= a, b <= 10^9
Inputs are integers
The result must be returned as an integer
Do not use multiplication, division, modulo, loops, or built-in product functions

Function Signature

def recursive_multiply(a, b):

Your question is Recursive Multiply Function. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Formal Specification

Input: Two integers, a and b.
Output: The integer value of a multiplied by b.
Restrictions: Do not use *, /, %, loops, or built-in product functions.

Constraints

-10^9 <= a, b <= 10^9
Inputs are integers
The result must be returned as an integer
Do not use multiplication, division, modulo, loops, or built-in product functions

Function Signature

def recursive_multiply(a, b):

Your question is Recursive Multiply Function. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.