leetle

Daily challenge for 2026-06-18

534. Longest Mountain Range Peak

Given an array of integers heights, find the length of the longest subarray that is strictly increasing. This represents the longest continuous 'climb' in a mountain range.

Example:
Input: heights = [1, 2, 3, 2, 5]
Output: 3
Explanation: The longest strictly increasing subarray is [1, 2, 3].

Run this challenge interactively in Python or JavaScript when the app loads.