Question d’entretien chez EdGe Networks

Find the largest substring palindrome in a given string.

Réponse à la question d'entretien

Utilisateur anonyme

13 août 2018

I solved it by generating all the odd and even length palindromes and stored the length in a variable. If the length of any subsequent palindrome was greater, i would update the max. This helped me solve this problem in O(n^2) with space O(1)