filmov
tv
leetcode 3.Longest Substring Without Repeating Characters- 2-pointer sliding window, duplicate index

Показать описание
See other videos @codeyao9796
Python solution to Leetcode problem 3: Longest Substring Without Repeating Characters. Here we first share the vanilla two-pointer sliding window method, then we explain the "duplicate index" method. The latter is also used in Leetcode problem 2461. If interested, please check out that video.
Python solution to Leetcode problem 3: Longest Substring Without Repeating Characters. Here we first share the vanilla two-pointer sliding window method, then we explain the "duplicate index" method. The latter is also used in Leetcode problem 2461. If interested, please check out that video.