Marketo

www.marketo.com

Interview Question

Software Engineer Interview(Student Candidate)

Find the longest substring with only two unique characters

  with time complexity O(n).
Tags:
algorithm
Answer

Add Answers or Comments

To comment on this, Sign In or Sign Up.