LeetCode 3 | Longest Substring Without Repeating Characters | C++ [ Approach and Code Explanation]

preview_player
Показать описание
This video contains detailed explanation on #LeetCode problem 3. Longest Substring Without Repeating Characters , along with code in C++.

The following question has been asked in various interviews including #Amazon , #Facebook , #Google , #Uber , #Microsoft , #LinkedIn etc.

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

Could you explain how you derived this algorithm?

anniamatthews
Автор

how can i use find() member function ... its error by using find() in vector... will you please suggest any alternative for that..

the.praveen.
Автор

V1.erase(v1.begin(), ++it). In this example the a at 5th index is pointed by it..But in this line, it erases only upto characters at 2nd index a..Can u explain what is the difference here...can u elaborate that line clearly?

madhumithasri
Автор

by using this code i got runtime error

_nancyjain