Power of a Number Implementation | Dataford Interview Questions

Power of a number implementation - iterative, recursive and template.

Implement exponentiation for an integer base and exponent using exponentiation by squaring. Provide iterative and recursive approaches, and explain how a reusable generic or template-style implementation supports numeric types with multiplication and division.

Use def power(base, exponent):; return a numeric result. Define 0^0 as 1 and do not test negative exponents with base 0.

Constraints

-10^9 <= exponent <= 10^9
base is an integer
If exponent is negative, base is not 0
Return 1 when exponent is 0
Results fit within the numeric representation used by the implementation

Function Signature

def power(base, exponent):

Your question is Power of a Number Implementation. 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

Power of a number implementation - iterative, recursive and template.

Use def power(base, exponent):; return a numeric result. Define 0^0 as 1 and do not test negative exponents with base 0.

Constraints

-10^9 <= exponent <= 10^9
base is an integer
If exponent is negative, base is not 0
Return 1 when exponent is 0
Results fit within the numeric representation used by the implementation

Function Signature

def power(base, exponent):

Your question is Power of a Number Implementation. 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.