🚀 LeetCode 3 – Longest Substring Without Repeating Characters (No HashSet!)
In this video, I’ve solved one of the most popular problems on LeetCode — Problem 3: Longest Substring Without Repeating Characters — in a simple and unique way 💡
👉 Instead of using a HashSet or HashMap, I used:
String slicing ✂️
A sliding-window-like approach
Basic loops and conditions
📌 What you’ll learn:
Clear explanation of the problem
Step-by-step examples
Dry run for better understanding
Clean Python solution
Time complexity breakdown
This approach is beginner-friendly and helps you understand the logic deeply without relying on extra data structures.
