Longest Substring Without Repeat

Longest Substring Without Repeat

Hard PHP PHP Strings 26 views
Explanation Complexity

Problem Statement

Find the length of the longest substring with all unique characters.

Input Format

One line string s.

Output Format

One integer length.

Example

abcabcbb
3

Constraints

|s|

Input / Output Format

Input Format
One line string s.
Output Format
One integer length.
Constraints
|s|

Examples

Input:
abcabcbb
Output:
3

Example Solution (Public)

PHP 
<?php
$inputText=rtrim(stream_get_contents(STDIN));
if($inputText==='') exit;
$last=[];
$start=0; $best=0;
for($i=0,$n=strlen($inputText);$i<$n;$i++){
  $ch=$inputText[$i];
  if(isset($last[$ch]) && $last[$ch] >= $start) $start=$last[$ch]+1;
  $last[$ch]=$i;
  $best=max($best,$i-$start+1);
}
echo $best;
?>

Official Solution Code

<?php
$inputText=rtrim(stream_get_contents(STDIN));
if($inputText==='') exit;
$last=[];
$start=0; $best=0;
for($i=0,$n=strlen($inputText);$i<$n;$i++){
  $ch=$inputText[$i];
  if(isset($last[$ch]) && $last[$ch] >= $start) $start=$last[$ch]+1;
  $last[$ch]=$i;
  $best=max($best,$i-$start+1);
}
echo $best;
?>
Please login to submit solutions.
Editor
Output

                                        

                                    

                                    

                                        

                                                                                    
Please login to submit solutions.