Courses/DSA Foundations/Recursion

Boss: Pow(x, n)

Beat the boss with fast exponentiation: halve the exponent to compute pow in O(log n).