334. Increasing Triplet Subsequence

Difficulty: Medium Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array. Formally the function should: Return true if there exists i, j, k such that 1arr[i] < arr[j] < arr[k] given 10 ≤ i < j < k ≤ n-1 else return false. Your algorithm should … Continue reading 334. Increasing Triplet Subsequence