From 7d6e8b17c99523b4664aef372557bda94cc2c364 Mon Sep 17 00:00:00 2001 From: Deven <63876261+devenperez@users.noreply.github.com> Date: Wed, 26 Nov 2025 15:06:16 -0500 Subject: [PATCH] Create README - LeetHub --- .../README.md | 35 +++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 0003-longest-substring-without-repeating-characters/README.md diff --git a/0003-longest-substring-without-repeating-characters/README.md b/0003-longest-substring-without-repeating-characters/README.md new file mode 100644 index 0000000..a2913fd --- /dev/null +++ b/0003-longest-substring-without-repeating-characters/README.md @@ -0,0 +1,35 @@ +

3. Longest Substring Without Repeating Characters

Medium

Given a string s, find the length of the longest substring without duplicate characters.

+ +

 

+

Example 1:

+ +
+Input: s = "abcabcbb"
+Output: 3
+Explanation: The answer is "abc", with the length of 3. Note that "bca" and "cab" are also correct answers.
+
+ +

Example 2:

+ +
+Input: s = "bbbbb"
+Output: 1
+Explanation: The answer is "b", with the length of 1.
+
+ +

Example 3:

+ +
+Input: s = "pwwkew"
+Output: 3
+Explanation: The answer is "wke", with the length of 3.
+Notice that the answer must be a substring, "pwke" is a subsequence and not a substring.
+
+ +

 

+

Constraints:

+ +