medium10 pts · first answer countsdynamic-programmingstringspalindromes
Longest palindromic substring in O(1) space
Which method finds the longest palindromic substring in O(n^2) time and O(1) extra space?
Discussion 0
Join free to post in the discussion.
Related questions
- Changing one character of a stringBackend Developer
- Reversing a simple stringBackend Developer
- Building a long string in a loopBackend Developer
- Palindrome check with two pointersBackend Developer
- Cleaning a pasted mobile numberBackend Developer
- Splitting a line with empty fieldsBackend Developer
- Letter to array indexBackend Developer
- Anagram check by sortingBackend Developer