Topic: Two Pointer Problem / Level: intermediate

Problem: Given a string, find the maximum number of non-overlapping palindromic substrings using two pointers.

Run the code to see the output here...