<p>Given a string <code>s</code>, return <em>the longest</em> <span data-keyword="palindromic-string"><em>palindromic</em></span> <span data-keyword="substring-nonempty"><em>substring</em></span> in <code>s</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;babad&quot;
<strong>Output:</strong> &quot;bab&quot;
<strong>Explanation:</strong> &quot;aba&quot; is also a valid answer.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;cbbd&quot;
<strong>Output:</strong> &quot;bb&quot;
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 1000</code></li>
	<li><code>s</code> consist of only digits and English letters.</li>
</ul>

class Solution {
public:
    bool palindromic(std::string& str) {
        int size = str.size();
        int size2 = size / 2;
        for (int i = 0; i < size2; i++) {
            if (str[i] != str[size - (i + 1)]) {
                return false;
            }
        }
        return true;
    }
    string longestPalindrome(string s) {
        std::vector<std::string> array_pol;
        std::string help = "";
        int pos = 0;
        int size = s.size();
        int max_pos = 0;
        int max_size = 0;
        int help_size = 0;
        while (pos != size) {
            for (int i = pos; s[i] != '\0'; i++) {
                help += s[i];
                help_size = help.size();
                if (help_size > max_size && palindromic(help)) {
                    array_pol.push_back(help);
                    if (max_size < help_size) {
                        max_pos = array_pol.size();
                        max_size = help_size;
                    }
                }
            }
            help = "";
            pos++;
        }

        return array_pol[max_pos - 1];
    }
};
17069