filmov
tv
Longest substring without repeating characters | Interview question | Facebook | Amazon | Google
![preview_player](https://i.ytimg.com/vi/3P-9PPrW54I/hqdefault.jpg)
Показать описание
This is one of common questions asked in Telephonic #Interview round of #Microsoft #Amazon #facebook. This video contains the explanation and code for the problem #LongestSubstringWithoutRepeatingCharacters.
Efficient solution, Time complexity O(n)
Please do let me know if you have any inputs/concerns for the solution.
Also do like, share and Subscribe :) Learn everyday
Thank you
Efficient solution, Time complexity O(n)
Please do let me know if you have any inputs/concerns for the solution.
Also do like, share and Subscribe :) Learn everyday
Thank you