Need Help!

Revision en1, by _Nishachor, 2020-05-17 19:07:29

Suppose a string s of size n is given. Now you have to answer the minimum number of characters to append at the end to make it a palindrome. How to solve this problem in O(n) time complexity?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English _Nishachor 2020-05-17 19:07:29 201 Initial revision (published)