From 49bbf47d43ddb00cb7ab07889938b550e64479a5 Mon Sep 17 00:00:00 2001 From: Deven <63876261+devenperez@users.noreply.github.com> Date: Sun, 8 Jan 2023 09:31:31 -0500 Subject: [PATCH] Create README - LeetHub --- .../README.md | 33 +++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 3-longest-substring-without-repeating-characters/README.md diff --git a/3-longest-substring-without-repeating-characters/README.md b/3-longest-substring-without-repeating-characters/README.md new file mode 100644 index 0000000..857ec8b --- /dev/null +++ b/3-longest-substring-without-repeating-characters/README.md @@ -0,0 +1,33 @@ +
Given a string s, find the length of the longest substring without repeating characters.
+
Example 1:
+ +Input: s = "abcabcbb" +Output: 3 +Explanation: The answer is "abc", with the length of 3. ++ +
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:
+ +0 <= s.length <= 5 * 104s consists of English letters, digits, symbols and spaces.