Pow(x, n) (LeetCode 50)
MediumLeetCode 50 · Modular Arithmetic & Fast Power · Google, Amazon +19 · 15:33Pow(x, n) · Reasoning · Dry Run · LINKEDIN · AMAZON · Leetcode-50 · Live Code + ExplanationMy notes
Sign in to keep private notes on every station, with video timestamps.
Pause here and write your approach in two lines. Compare it with MIK's when the video ends.
Sign in to write your approach →About this video
Video solution for LeetCode 50 Pow(x, n) by codestorywithMIK: Math, Medium. Topics: Math, Recursion. Watch the explanation, then check the code and solve it on LeetCode.
- Problem
- LeetCode 50: Pow(x, n)
- Difficulty
- medium
- Topics
- Math, Recursion
- Patterns
- Modular Arithmetic & Fast Power
- Chapter
- Math
- Duration
- 15:33