Pagini recente » Istoria paginii runda/cssc | Diferente pentru blog/rolling-hash intre reviziile 19 si 20 | Diferente pentru blog/rolling-hash intre reviziile 24 si 22 | Diferente pentru blog/algoritmiada-2018 intre reviziile 16 si 15 | Diferente pentru blog/rolling-hash intre reviziile 18 si 19
Nu exista diferente intre titluri.
Diferente intre continut:
h2. Largest palindrome
bq. Given a string of length n, find out it's largest palindromic subsequence.
bq. Given a string of length n, find out it's largest palindromic substring.
The naive solution is O(n^3^). For every possible subsequence it tests in linear time if it's a palindrome.
The naive solution is O(n^3^). For every possible substring it tests in linear time if it's a palindrome.
A smarter solution tries every position in the original string as the center of a palindrome and extends to the left and to the right as long as the corresponding characters match. This solution takes O(n^2^) time.
Nu exista diferente intre securitate.
Topicul de forum nu a fost schimbat.
