Naive (Longest Palindromic Substring Longest Palindromic Substring): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O({1})$ auxiliary words (https://www.geeksforgeeks.org/longest-palindrome-substring-set-1/) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference == -") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O({1})$ | $O({1})$ words | ||
(https://www.geeksforgeeks.org/longest-palindrome-substring-set-1/) | (https://www.geeksforgeeks.org/longest-palindrome-substring-set-1/) | ||
Latest revision as of 08:57, 10 April 2023
Time Complexity
$O(n^{3})$
Space Complexity
$O({1})$ words
(https://www.geeksforgeeks.org/longest-palindrome-substring-set-1/)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1940
Reference
-