Dynamic Programming (Longest Palindromic Substring Longest Palindromic Substring)

From Algorithm Wiki
Revision as of 11:16, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n^{2})$ words (https://www.geeksforgeeks.org/longest-palindrome-substring-set-1/) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1953 == Reference == -")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{2})$

Space Complexity

$O(n^{2})$ words

(https://www.geeksforgeeks.org/longest-palindrome-substring-set-1/)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1953

Reference

-

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Dynamic_Programming_(Longest_Palindromic_Substring_Longest_Palindromic_Substring)&oldid=45458"