Easy data structure and algorithm practice puzzle.
Given a base and an exponent, return base to that power using O(log n) multiplications. Anything to the power 0 is 1. Otherwise, work out the power for half the exponent and square it. If the exponent is odd, multiply by the base one more time. This is how encryption raises huge numbers to huge powers.
Solve it three ways: snap the jigsaw pieces together, fill in the blanks, or type it from scratch against the tests. This one is free.
Every line of the solution comes with a note explaining why it is there, and a step by step replay shows the code running. At level 3, where you type it yourself, you can ask for an AI mock interview on this problem that ends with a hiring manager's scorecard.
Then grow it into a real project with the Software Engineer button: this puzzle becomes the Shot Hierarchy Report, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles