Non-decreasing Array | Leetcode 665 | Live coding session | LC 665

preview_player
Показать описание

1) 0:00 Explaining the problem out loud
2) 1:10 Algorithm walkthrough
3) 6:15 Coding it up
4) 8:00 Time Complexity

PS : Please increase the speed to 1.25X
Рекомендации по теме
Комментарии
Автор

I love how you comment each part of your code, making it so clear and easy to understand

shrimpo
Автор

Thanx bhaiya it's really very good explanation 👏👏👏 appreciated..

AnshuKumar-znqb
Автор

Thanks
After headscratching condition
Ur videos are boon!

sagarbora
Автор

great stuff coding decoded, really appreciate ur work

JameS
Автор

for test case-2 1, 4, 2 you showed valid modification 1, 2, 2 . what do you think about 1, 4, 4 it will be correct or not ?

ruhulaminsrabon
Автор

why increase or decrease
any one is okay why both....?;

adityarajmane
visit shbcf.ru