longest-palindromic-substring__pattern-4-palindromic-subsequence__grokking-dynamic-programming-patterns-for-coding-interviews
Topic | Replies | Views | Activity | |
---|---|---|---|---|
How's brute force time complexity O(3^N)? |
![]() ![]() ![]() |
2 | 151 | January 4, 2022 |
Longest Palindromic Substring |
![]() ![]() |
1 | 183 | December 30, 2021 |
Return String instead of length |
![]() ![]() ![]() ![]() ![]() |
6 | 439 | October 24, 2021 |
Apply bottom up from Longest Palindromic SubSequence formula |
![]() |
0 | 75 | March 27, 2021 |
Longest Palindromic Substring for loops |
![]() |
0 | 149 | October 19, 2019 |
For basic solution, can we just compare c2 and c3 without c1? |
![]() ![]() ![]() |
2 | 199 | June 13, 2019 |