Longest Substring Without Repeating Characters | JavaScript | Python | Leetcode Explained

Published: 15 November 2023
on channel: Coderslang: Become a Software Engineer

In this programming tutorial we're going to break down the coding problem "Longest Substring Without Repeating Characters" also known as "Longest Unique Substring". It's a tricky problem that appears in many coding interviews.

Key points:
sliding window grows on every iteration of the main loop
sliding window shrinks until the current element is not in the set
on every iteration of the main loop update the max if necessary

00:00 - Intro
01:14 - Brute Force Solution Explained
03:30 - Brute Force in JavaScript
06:13 - Optimal Solution (Sliding Window) Explained
08:55 - JavaScript implementation (Linear complexity)
11:26 - Python implementation (Sliding window)

On this page of the site you can watch the video online Longest Substring Without Repeating Characters | JavaScript | Python | Leetcode Explained with a duration of hours minute second in good quality, which was uploaded by the user Coderslang: Become a Software Engineer 15 November 2023, share the link with friends and acquaintances, this video has already been watched 29 times on youtube and it was liked by 0 viewers. Enjoy your viewing!