longest-palindromic-substring Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.

Without regex you would use substr (string,start_pos,substring_length) which can be irritatingly verbose, let me tell you. If JohnTitor used an inline view, something like: ...