Longest Palindrome
Lesson 2 of 3 in Coddy's Interview Coding Challenges - Pack VII course.
Challenge
MediumWrite a function named longestPalindrome to find the longest palindromic substring in a string.
A palindromic substring is a substring that is also a palindrome.
The function should take a string as input and return the longest palindromic substring.
If there are multiple palindromic substrings of the same length, the function should return the first one that appears in the string.
Try it yourself
char* longestPalindrome(char* s) {
// Write code here
}