3660. Jump Game IX

LeetCodeArrayDynamic ProgrammingOpen on judge ↗

You are given an integer array nums. From any index i, you can jump to another index j under the following rules: - Jump to index j where j > i is allowed only if nums[j] < nums[i]. - Jump to index j where j < i is allowed only if nums[j] > nums[i]. For each index i, find the maximum value in nums that can be reached by following any sequence of valid jumps starting at i. Return an array ans

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI