Math & Geometry/Medium

Pow(x, n)PRO PASS

Time: O(log N)Space: O(1)

Binary exponentiation: square base x and halve exponent n at each step.

Array Elements & Pointers

[0]

[1]

[2]

[3]

[4]

Live Variables & Invariants

status:Initialized

pattern:Pow(x, n)

Step 1 / 333%

Solution Code

function myPow(x: number, n: number): number {

  if (n === 0) return 1;

  if (n < 0) { x = 1 / x; n = -n; }

  let res = 1;

  while (n > 0) {

    if (n % 2 === 1) res *= x;

    x *= x; n = Math.floor(n / 2);

  return res;

Input your custom values and visualize step-by-step trace

Quick Presets:

Contextual Tutor for Pow(x, n)

Hello! I am your AI DSA Tutor for **Pow(x, n)** (Math & Geometry). Ask me anything about this algorithm, time complexity, or request a step hint!