Oracleseniornov. de 2025
https://leetcode.com/problems/longest-mountain-in-array/description/
Find the length of the longest contiguous "mountain" subarray — a strictly increasing sequence immediately followed by a strictly decreasing sequence with length ≥ 3 — or return 0 if none exists. The core challenge is detecting peaks and measuring maximal increasing-then-decreasing windows efficiently (ideally in one pass and O(1) space).
Use esses exemplos para entender em que contexto ela costuma cair e adaptar sua prática.
https://leetcode.com/problems/longest-mountain-in-array/description/
Nenhum anexo público associado a esta pergunta.
No app você encontra perguntas parecidas, compara empresas e aprofunda essa busca com mais filtros.