Freshworks Interview Question

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