Question 1 (10points). Given a string s, return the longest palindromic substring in s. Example 1: Input: s = ‘babad’ Ou

[answerhappygod]

Question 1 (10points). Given a string s, return the longest
palindromic substring in s. Example 1: Input: s = ‘babad’ Output:
‘bab’, ‘aba’ is also correct (just return one solution, no need to
give all possible solutions) Note: please use dynamic programming
method. Using other methods will not receive any credit. For
graduate students: analyze the complexity of brute-force method and
the dynamic programming in big-O notation.
Q1.py