An integer array nums of length n is defined as trionic if there exist two indices p and q with $0 <$ p $<$ q $<$ n $- 1$ such that:

• The prefix from index $0$ to index p is strictly increasing: nums[0] $<$ nums[1] $<$ $\dots$ $<$ nums[p]

• The segment from index p to index q is strictly decreasing: nums[p] $>$ nums[p + 1] $>$ $\dots$ $>$ nums[q]

• The suffix from index q to index n $- 1$ is strictly increasing: nums[q] $<$ nums[q + 1] $<$ $\dots$ $<$ nums[n - 1]

Given an integer array nums, return true if nums is trionic, or false otherwise.

Constraints:

• $3 \leq$ n $\leq 100$

• $-1000 \leq$ nums[i] $\leq 1000$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.