We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 620e326 commit 8da13e7Copy full SHA for 8da13e7
0003_Longest_Substring_Without_Repeating_Characters.java
@@ -1,7 +1,13 @@
1
-// id: 3
2
-// Name: Longest Substring Without Repeating Characters
3
-// link: https://leetcode.com/problems/longest-substring-without-repeating-characters/
4
-// Difficulty: Medium
+/*
+ * 3. Longest Substring Without Repeating Characters
+ * Problem Link: https://leetcode.com/problems/longest-substring-without-repeating-characters/
+ * Difficulty: Medium
5
+ *
6
+ * Solution Created by: Muhammad Khuzaima Umair
7
+ * LeetCode : https://leetcode.com/mkhuzaima/
8
+ * Github : https://github.com/mkhuzaima
9
+ * LinkedIn : https://www.linkedin.com/in/mkhuzaima/
10
+ */
11
12
class Solution {
13
public int lengthOfLongestSubstring(String s) {
0 commit comments