Microsoft Interview Question: Given a string, find the longest sub-string that has at most 2 different characters in O(n) time complexity. | Glassdoor

Skip to content Skip to footer

Notifications

Loading...

employer cover photo

Microsoft

Microsoft Software Engineer interview

Microsoft Interview Question

Software Engineer Interview

Given a string, find the longest sub-string that has at most 2 different characters in O(n) time complexity.

Related searches: Microsoft reviews | Microsoft jobs | Microsoft salaries | Microsoft benefits | Microsoft conversations

Microsoft interviews