← MakeMyTrip questions

Maximum distinct speakers in M continuous days

Filed under MakeMyTrip

Given a string representing daily speakers (A-Z) over N days, find the maximum number of distinct speakers in any sliding window of size M.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related MakeMyTrip questions

Collected from public candidate posts and coding forums. Updated Nov 2026.