Longest Substring Without Repeating Characters | LeetCode 3
AFFILIATE LINKS Great resource I use to learn algorithms.40% off Tech Interview Pro: http://techinterviewpro.com/terriblewhiteboard20% off CoderPro: http://coderpro.com/terriblewhiteboard The way we’ll solve this is using the sliding window technique. For this, we need a set and two pointers. The pointers keep track of the “window”. For example, if the left pointer is at index 1 and the right …
Longest Substring Without Repeating Characters | LeetCode 3 Read More »