Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 334 with 22 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 334 # by problem number
lcpy gen -s increasing_triplet_subsequence # by problem name
nums, return true if there exists a triple of indices (i, j, k) such that i < j < k and nums[i] < nums[j] < nums[k]. If no such indices exists, return false.
Input: nums = [1,2,3,4,5]
Output: true
Explanation: Any triplet where i < j < k is valid.
Input: nums = [5,4,3,2,1]
Output: false
Explanation: No triplet exists.
Input: nums = [2,1,5,0,4,6]
Output: true
Explanation: One of the valid triplet is (1, 4, 5), because nums[1] == 1 < nums[4] == 4 < nums[5] == 6.
1 <= nums.length <= 5 * 10^5-2^31 <= nums[i] <= 2^31 - 1O(n) time complexity and O(1) space complexity?
class Solution:
# Time: O(n)
# Space: O(1)
def increasing_triplet(self, nums: list[int]) -> bool:
first: int | None = None
second: int | None = None
for x in nums:
if first is None or x <= first:
first = x
elif second is None or x <= second:
second = x
else:
return True
return False
| Time | Space |
|---|---|
| O(n) | O(1) |