334. Increasing Triplet Subsequence | LeetCode 75 #8 | Array / String

preview_player
Показать описание
334. Increasing Triplet Subsequence | LeetCode 75 #8 | Array / String
Ace Coding Interview with 75 Leetcode questions.

Рекомендации по теме
Комментарии
Автор

But this condition i < j < k is not satisfied.

WalterWhite-zuxz
Автор

This is super clear, great visual, thank you!

teewuane
Автор

I was stuck in this problem for last 2 hours, amazing solution, Thank you sir

vaibhavshukla
Автор

Can you please remove this incorrect solution

Zamien
Автор

did you write this video with ai? the value of 0 may be less then your n1 variable but the value of the iterator is not and invalidates this solution, go read a book

saulifshin
Автор

wow...this is awful and wrong; the first example [7, 1, 2, 0, 3] is true, but not bc 0<2<3. Its true bc 1<2<3 - position matters.

JonMcLean-yu
join shbcf.ru