334. Increasing Triplet Subsequence || Python || LeetCode

Given an integer array nums, return true if there exists a triple of indices (i, j, k) such that I less than j less than k and nums[i] less than nums[j] less than nums[k]. If no such indices exist, return false.