← All problemsSign in

3637. Trionic Array I

LeetCodeArrayOpen on judge ↗

You are given an integer array nums of length n. An array is trionic if there exist indices 0 < p < q < n - 1 such that: - nums[0...p] is strictly increasing, - nums[p...q] is strictly decreasing, - nums[q...n - 1] is strictly increasing. Return true if nums is trionic, otherwise return false. Example 1: Input: nums = [1,3,5,4,2,6] Output: true Explanation: Pick p = 2, q = 4: - nums[0

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start