Pergunta de entrevista da empresa PhonePe

Longest Substring Without Repeating Characters – Solved using sliding window with a hash set/map to track characters and update window pointers.