Ajay Bhave

Results 2 issues of Ajay Bhave

Manchar's Algorithm is used to find the longest Palindromic Sub-string in any string.Time complexity of Manchar's Algorithm is O(n).

please merge my PR

Optimize Code
Resolve Conflict
Provide Input