#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/meta-interview-prep-v2/coding-patterns-i-arrays-strings-stacks/lc-50-powx-n-implementation

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░███████████████████████████████████████████████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/meta-interview-prep-v2/coding-patterns-i-arrays-strings-stacks/lc-50-powx-n-implementation

Repovive

LeetCode 50 Pow(x, n) - Implementation - Coding Patterns I: Arrays, Strings & Stacks | Meta Interview Prep | Repovive

Repovive.

Meta Interview Prep6 sections · 147 units8h total

Open in Course

LeetCode 50 Pow(x, n) - Implementation

The code

Use binary exponentiation: square when the exponent is even, multiply when odd. Handle negative exponents by inverting x.

Here's the solution:

function myPow(x, n):
    if n < 0:
        x = 1 / x
        n = -n
    result = 1
    while n > 0:
        if n is odd:
            result = result * x
        x = x * x
        n = n / 2  (integer division)
    return result

$O(\log n)$ time, $O(1)$ space.