How do I reduce time complexity of this substring palindrome?

Question

I am solving this problem, input: a string, output: it\'s longest substring that is a palindrome I solved it in the below manner in O(n^3). I am trying to solve it in O(n^2)