└── README.md


/README.md:
--------------------------------------------------------------------------------
 1 | # Longest-Substring-without-Repeating-character1
 2 | 
 3 | 
 4 | 
 5 | class Solution {
 6 |     public int lengthOfLongestSubstring(String s) {
 7 |         int n=s.length();
 8 |         int res=0;
 9 |         for(int i=0;i<n;i++)
10 |         {
11 |             boolean[] visited=new boolean[256];
12 |             for(int j=i;j<n;j++)
13 |             {
14 |                 if(visited[s.charAt(j)])
15 |                 {
16 |                     break;
17 |                 }
18 |                 else
19 |                 {
20 |                     res=Math.max(res,j-i+1);
21 |                     visited[s.charAt(j)]=true;
22 |                 }
23 |             }
24 |         }
25 |         return res;   
26 |     }
27 | }
28 | 


--------------------------------------------------------------------------------