Increasing Triplet Subsequence
Given an integer array nums, return true if there exists a triple of indices (i, j, k) such that i < j < k and nums[i] < nums[j] < nums[k]. If no such indices exists, return false.
Follow up: Could you implement a solution that runs in O(n) time complexity and O(1) space complexity?
Example 1
Input
nums = [1,2,3,4,5]Output
trueAny triplet where i < j < k is valid.
Example 2
Input
nums = [5,4,3,2,1]Output
falseNo triplet exists.
Constraints
- 1 <= nums.length <= 5 * 10^5
- -2^31 <= nums[i] <= 2^31 - 1
Asked at 7 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.