Practice · 4 of 5

Longest rising run

CHALLENGE

Difficulty: intermediate+25 XP

Implement int longestRisingRun(int[] arr): the length of the longest stretch of strictly increasing adjacent values. {3, 1, 2, 3, 0, 5} → 3. This is adjacency scanning + an accumulator + a seeded best — compose them; run the empty and single probes first.

Press Submit to check your solution.

Back to lesson: Practice: Mixed clinic