Longest Substring Without Repeating Characters is a coding interview question asked in Amazon Interview.
Question:
Given a string,
find the length of the longest substring without repeating characters.
Example:
The longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3.
For "bbbbb" the longest substring is "b", with the length of 1.
----------------------------------------------------------------------------------------------------
To get notified of all the new videos, subscribe - kzread.info?sub_co...
Learn more about Scaler - www.scaler.com/?Yo...
Follow us on Linkedin - / scaler
----------------------------------------------------------------------------------------------------