longest-palindromic-subsequence__pattern-4-palindromic-subsequence__grokking-dynamic-programming-patterns-for-coding-interviews
Topic | Replies | Views | Activity | |
---|---|---|---|---|
Try it yourself section is not there in coding interview Longest Palindromic Subsequence |
![]() ![]() |
2 | 44 | December 9, 2021 |
For the DP solution, Why startIndex start from the last character of the string |
![]() ![]() ![]() ![]() ![]() |
7 | 356 | July 23, 2021 |
Brute force solution complexity |
![]() ![]() ![]() |
6 | 256 | February 13, 2021 |
What would be the easiest way to return the longest substring or subsequence ?. Is there a pattern that we could follow? |
![]() ![]() |
2 | 286 | February 24, 2019 |