Sliding Window 4 - Medium - Longest Substring Without Repeating Characters - JAVA

Coding Interviews- Longest Substring Without Repeating Characters (LeetCode)
This interview question is commonly asked by companies like Microsoft, Facebook, Amazon.
In this video we have solved the problem using Optimized Sliding Window approach along with visual representation of example.

Time Complexity -
For the above algorithm, the Time Complexity will be O(N), where 'N' is the number of characters in the input string.

Space Complexity -
The Space Complexity of the algorithm will be O(K), where 'K' is the number of distinct characters in the input string.

Link to the videos of Sliding Window playlist

1. Max sum subarray of size k - https://youtu.be/-rji0auUztU
2. Smallest Subarray with a given sum / Minimum Size Subarray Sum - https://youtu.be/wlcioUsBcOA
3. Longest Substring with K Distinct Characters - https://youtu.be/e-1X91PcjsA
4. Longest Substring with distinct (without repeating) Characters - https://youtu.be/QQmavXArQ4M
5. Longest Substring with same letters after replacement - https://youtu.be/uPyRa3bvcCc
6. Permutation in a String - https://youtu.be/YZ9JyvSSQ_g
7. String Anagrams - https://youtu.be/PAq9UtFg_04
8. Minimum window substring - https://youtu.be/71FgTUWNVtw
9. Words Concatenation - https://youtu.be/mIY9saZy4o0

Know more about me
LinkedIn - https://www.linkedin.com/in/umang-mavani/