Pergunta de entrevista da empresa Freshworks

1. longest substring palindrome in O(N^2) time complexity.