Quorum interview question

Flood-fill Longest substring without repeating characters How would you describe excellent code?