Here's a question I like to give to high schoolers:
Show that if we remove any square from a $ 8 \times 8$ chessboard, then the rest can be perfectly tiled with $21$ L-shaped triminos.
It can be approached by tedious case checking. Using symmetry we still have to check 10 cases, and that can be frustrating.
Or it could be done by induction. What do you induct on?
Here's a not-so-good example
Prove that in an acute triangle, we can inscribe a square with a base on one side of the triangle, and vertices on the other 2 sides of the triangle.
There are numerous ways to approach the problem directly like using similarity (which is why this is a not-so-good example).
The reason it's relevant: One approach that I like is to relax the "square" condition to "rectangle" (the general case), with the similar constraints on the vertices/edges. It is obvious that we can construct such a rectangle for any height.
Then, we use IVT to show that "length = height" and hence we have a square. In fact, the length and height varies linearly, and we could even graphically determine the height of the square.