---
title: "Discussion on \"Longest Substring Without Repeating Characters - LeetCode(Medium) - Sliding Window Technique!\" | Hashnode"
description: "Discussion on \"Longest Substring Without Repeating Characters - LeetCode(Medium) - Sliding Window Technique!\". In this article, I show you how to solve the LeetCode problem - Longest Substring Without Repeating Characters using Sliding Window Technique."
url: "https://hashnode.com/posts/longest-substring-without-repeating-characters-leetcodemedium-sliding-window-technique/610ffacc528eff11aea8b3ef"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Longest Substring Without Repeating Characters - LeetCode(Medium) - Sliding Window Technique!](https://procode.hashnode.dev/longest-substring-without-repeating-characters-leetcodemedium-sliding-window-technique?utm_source=hashnode&utm_medium=feed)

In this article, I show you how to solve the LeetCode problem - Longest Substring Without Repeating Characters using Sliding Window Technique.

Aug 8, 2021 · 4 min read · procode.hashnode.dev  
Read the article

-   [#algorithms](https://hashnode.com/tag/algorithms)
-   [#learning](https://hashnode.com/tag/learning)
-   [#cpp](https://hashnode.com/tag/cpp)
-   [#codenewbies](https://hashnode.com/tag/codenewbies)
-   [#programming](https://hashnode.com/tag/programming)

## Written by

[Pradipta Ghoshal](https://hashnode.com/@procode)

@procode

  
[View profile](https://hashnode.com/@procode)

Problem Solver

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
