Easy data structure and algorithm practice puzzle.
Given a string of parentheses, return how deeply they nest. So "((()))" is 3 and "()()" is 1. Keep a counter that goes up on "(" and down on ")", and track the highest it gets. It's a stack where you only need to know the height.
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 Document Expression Evaluator, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles