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.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3637. Trionic Array I

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact