My contribute to solve problem at competition by # GIZ-pass GIZ task for candidate test

1. Fork the repo
2. Clone the forked repo to your local machine
3. Commit your solution
4. push your solution to your forked repo
5. Send the link of your solution repo over the form

Given a string s, return the longest palindromic substring in s.

Example 1:

Input: s = "babad"

Output: "bab"

Note: "aba" is also a valid answer.

Example 2:

Input: s = "cbbd"

Output: "bb"

Example 3:

Input: s = "a"

Output: "a"

Example 4:

Input: s = "ac"

Output: "a"