Increasing Triplet Subsequence || Leetcode JAVA || O(N)

Hi folks!
Here we are solving 334. Increasing Triplet Subsequence || Leetcode C++ || O(N) time complexity || O(1) Space complexity

Easy explanation in Hindi.

If you have any queries reach out to me at

[cooltomcatty]

Wow what an explanation bro! 🤩🤩🤩 God bless you 🥰🥰🥰

[cooltomcatty]

I just found that It's similar to partion sort (card game)

[asjadahmad]

samjhane ka tarika kaafi badhiya
keep it up bro

[udyanishere]

// C++ :
class Solution {
public:
bool nums) {
int N = nums.size();
int left = INT_MAX;
int mid = INT_MAX;

for(int num : nums) {
// num = nums[i];
if(num<=left) {
left = num;
} else if(num<=mid) {
mid = num;
} else {
return true;
}
}

return false;
}
};

[udyanishere]

// Python3 :
class Solution:
def increasingTriplet(self, nums: List[int]) -> bool:
left, mid = sys.maxsize, sys.maxsize
for num in nums:
if num <= left:
left = num
elif num <= mid:
mid = num
else:
return True
return False

[vinaykaushikinvisble]

why did you check for <= in conditions

[udyanishere]

// JAVA :
class Solution {
public boolean increasingTriplet(int[] nums) {
int N = nums.length;
int left = Integer.MAX_VALUE;
int mid = Integer.MAX_VALUE;

for(int num : nums) {
// num = nums[i];
if(num<=left) {
left = num;
} else if(num<=mid) {
mid = num;
} else {
return true;
}
}

return false;
}
}
// O(N) TC
// O(1) SC