Leetcode 3637. Trionic Array I

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.