Medium data structure and algorithm practice puzzle.
Given the lines of a verse, return the INDEX of the line with the most words. If two tie, return the first one. Count each line's words, splitting on spaces and skipping empty pieces, and keep the index of the best line so far. You return the index so the caller can find the line in the original list.
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 Track Expression Evaluator, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles