[Solved] Write a JavaScript function to find longest substring in a given a string without repeating characters

by 


function sort(names)
{
    string="";
    ss="";
    namestring=names.split("");

    for(j=0;j<namestring.length;j++) {
        for(i=j;i<namestring.length;i++) {
            if(string.includes(namestring[i]))
                break;
            else
                string+=namestring[i];
         }
         if(ss.length<string.length)
             ss=string;
         string="";
    }
    return ss;
}
console.log(sort("google.com"));

It’s o(n^2) complexity but try this(may be o(n^3) if contains function take o(n) complexity)

function sort(names)
{
    string="";
    ss="";
    namestring=names.split("");

    for(j=0;j<namestring.length;j++) {
        for(i=j;i<namestring.length;i++) {
            if(string.includes(namestring[i])) // if contains not work then  
                break;                         //use includes like in snippet
            else
                string+=namestring[i];
         }
         if(ss.length<string.length)
             ss=string;
         string="";
    }
    return ss;
}
console.log(sort("google.com"));

4

solved Write a JavaScript function to find longest substring in a given a string without repeating characters