🧠 Before you code — what pattern fits?
Given an integer array nums, return true if there exist indices i < j < k with nums[i] < nums[j] < nums[k]; otherwise return false. Aim for O(n) time and O(1) space.
[1,2,3,4,5] → true
[5,4,3,2,1] → false
[2,1,5,0,4,6] → true
🎬 Video explanation · Algorithms Made Easy
Your solution runs against 3 unit tests, including edge and large-value cases.
Loading...
Test console · 3 unit tests
Submit your code to run it against all 3 unit tests. Results appear here.
JavaScript, TypeScript & Python run sandboxed in your browser; other languages run on the execution server. Your code is saved locally as you type.