Available question text
Determine whether the array can be partitioned at indices 0 < p < q < n-1 into three contiguous segments that are strictly increasing, then strictly decreasing, then strictly increasing, returning true if such p and q exist.
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 3637. Trionic Array I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source