We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent c4eef37 commit 0b9d38fCopy full SHA for 0b9d38f
Leetcode_30day_challenge/Increasing_Triplet_Subsequence.py
@@ -1,4 +1,5 @@
1
# Solution - 1: Time: O(N)
2
+# This will only check for existence of a Valid Triplet. THIS WILL NOT GIVE WHAT THAT TRIPLET IS.
3
class Solution:
4
def increasingTriplet(self, nums: List[int]) -> bool:
5
# Set both the first and the second values as MAX value
0 commit comments