Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3640. Trionic Array II
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.