Increasing Triplet Subsequence, is a LeetCode problem from Array subdomain. In this post we will see how we can solve this challenge in Swift

Problem Description

You can find the full details of the problem Increasing Triplet Subsequence at LeetCode

Solution

the other is to store the second smallest value.

          Return true once find a value greater than both.

Time Complexity: O(n), Space Complexity: O(1)

Please check the main.swift snippet for the solution.

This solution originally posted at: Github by @soapyigu