longest palindromic substring python

1class Solution(object):
2   def longestPalindrome(self, s):
3      dp = [[False for i in range(len(s))] for i in range(len(s))]
4      for i in range(len(s)):
5         dp[i][i] = True
6      max_length = 1
7      start = 0
8      for l in range(2,len(s)+1):
9         for i in range(len(s)-l+1):
10            end = i+l
11            if l==2:
12               if s[i] == s[end-1]:
13                  dp[i][end-1]=True
14                  max_length = l
15                  start = i
16            else:
17               if s[i] == s[end-1] and dp[i+1][end-2]:
18                  dp[i][end-1]=True
19                  max_length = l
20                  start = i
21      return s[start:start+max_length]
22ob1 = Solution()
23print(ob1.longestPalindrome("ABBABBC"))

1max(a_list, key=len)

1#include <iostream>
2#include <string>
3#include <unordered_set>
4using namespace std;
5
6// expand in both directions of low and high to find all palindromes
7void expand(string str, int low, int high, auto &set)
8{
9	// run till str[low.high] is a palindrome
10	while (low >= 0 && high < str.length()
11			&& str[low] == str[high])
12	{
13		// push all palindromes into the set
14		set.insert(str.substr(low, high - low + 1));
15
16		// expand in both directions
17		low--, high++;
18	}
19}
20
21// Function to find all unique palindromic substrings of given string
22void allPalindromicSubstrings(string str)
23{
24	// create an empty set to store all unique palindromic substrings
25	unordered_set<string> set;
26
27	for (int i = 0; i < str.length(); i++)
28	{
29		// find all odd length palindrome with str[i] as mid point
30		expand(str, i, i, set);
31
32		// find all even length palindrome with str[i] and str[i+1] as
33		// its mid points
34		expand(str, i, i + 1, set);
35	}
36
37	// print all unique palindromic substrings
38	for (auto i : set)
39		cout << i << " ";
40}
41
42int main()
43{
44	string str = "google";
45
46	allPalindromicSubstrings(str);
47
48	return 0;
49}