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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.