Medium data structure and algorithm practice puzzle.
Given a melody as note numbers, return the most times in a row the melody goes up. So [1, 2, 3, 2, 4] is 2, and a melody that only falls is 0. Walk through once and compare each note with the one before. If it went up, add one to your streak. If not, reset to 0. Keep the best streak.
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 Audit Trail, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles