Easy data structure and algorithm practice puzzle.
Given n, return true if it's a perfect square, like 16. Binary search the possible roots from 1 to n. If mid x mid equals n, return true. If it's too small, go higher. If it's too big, go lower. If the range runs out, return false.
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 Clause Ordered Index, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles