3640. Trionic Array II

LeetCodeArrayDynamic ProgrammingOpen on judge ↗

You are given an integer array nums of length n. A trionic subarray is a contiguous subarray nums[l...r] (with 0 <= l < r < n) for which there exist indices l < p < q < r such that: - nums[l...p] is strictly increasing, - nums[p...q] is strictly decreasing, - nums[q...r] is strictly increasing. Return the maximum sum of any trionic subarray in nums. Example 1: Input: nums = [0,-2,-1,-3,0,

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