Leetcode 3. Longest Substring Without Repeating Characters (Python)

preview_player
Показать описание
Leetcode 3. Longest Substring Without Repeating Characters (Python)

In this video, I solve the Leetcode Longest Substring Without Repeating Characters using Sliding Window. Very popular question with MAANG in panel coding interviews.
You can find code on my (Ravina Gaikawad) GitHub repository. Find the link below.

If you have any algorithm problems you want me to solve please let me know in the comments below.

Ravina Gaikawad
Pseudocoder

#codinginterview #algorithm #leetcode #python #programming #faang #dsa #youtubevideo #pseudocoderravina #education #job #jobapplication #jobsearch #interview #algo #datastructures #dsalgo #interviewquestions #interviewpreparation #easy #easytech #software #softwareengineer #heap #pythonprogramming #array #list
Рекомендации по теме
Комментарии
Автор

Best explanation and walkthrough of this problem from what I saw so far, thank you. The walkthrough really helped.

raisanusrat
Автор

at 8:27 i think you forgot to add 'e' to the dictionary
also, great explanation! I understood everything you explained, but how do i start thinking like this instead of copying others' results?

kshitijsahdev
join shbcf.ru