LinkedIn logoLinkedIn
CodingMembers

Pow(x, n) (LC 50)

Members only

Implement `pow(x, n)` for positive and negative integer exponents. The round expects an O(log n) solution in both recursive and iterative form, plus explicit handling of the minimum signed-integer exp...

SWE
math
recursion
complexity-analysis
medium
Frequency
Single report
Last asked
2026-08-16
Stage
onsite-coding

Log in to continue reading the full content

Comments

Sign in to join the discussion
Loading...