MEDIUM NC#141 Math & Geometry
50. Pow(x, n)
📖 Problem
Implement pow(x, n), which calculates x raised to the power n.
🧠 Visual Learning Aid
1 Model the input into the right structure
2 Choose the core technique and invariant
3 Execute step-by-step with a sample
4 Validate complexity and edge cases
JS/TS Refreshers
- •Array methods (`push`, `pop`, `shift`, `slice`)
- •Object/Map/Set usage patterns
- •Function parameter and return typing
Logical Thinking Concepts
- •Define invariants before coding
- •Check edge cases first (`[]`, single element, duplicates)
- •Estimate time/space before implementation
💡 Approach
- → Handle negative n by converting to positive and using 1/x
- → Use iterative approach: x^15 * x^14 * x^13 * ...
- → Or use binary exponentiation for O(log n) time
- → Time: O(log n), Space: O(1)
🧭 Prerequisites
🛠️ Hints & Pitfalls
Hints
- •Handle negative n by converting to positive and using 1/x
- •Use iterative approach: x^15 * x^14 * x^13 * ...
- •Or use binary exponentiation for O(log n) time
Common Pitfalls
- •Time: O(log n), Space: O(1)
🧪 Test Cases
Hidden tests on submit: 1
Test Case 1
Not run Input:
myPow(2, 10); Expected:
2147483648 Test Case 2
Not run Input:
myPow(2.1, 3); Expected:
9.261000000000001 Test Case 3
Not run Input:
myPow(2, -2); Expected:
0.5 📝 Code Editor
📤 Output