Longest Continuous Increasing Subsequence || Leetcode 674 || C++ Solution

preview_player
Показать описание
If you have any doubt or have any suggestions/ improvements that need to be made from my side, Please feel free to comment :)

If you like my videos, please subscribe to my channel.

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

Really great explanation but can you please tell me why we took nums.size() -1 instead of just nums.size();

Ayush-jzum