In the following problem

https://leetcode.com/problems/increasing-triplet-subsequence

We are able to tell whether or not such a triplet exists in O(n) time, O(1) space.

But extending this problem, can we actually determine one such i,j,k values in O(n) time, and O(1) space? Seems unlikely to me.