Available question text
Find the maximum-sum contiguous subarray that can be partitioned (at two interior pivots) into three strict monotone runs: strictly increasing, then strictly decreasing, then strictly increasing. n is up to 1e5, nums values up to 1e9, and at least one such trionic subarray exists.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3640. Trionic Array II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source