longest-bitonic-subsequence__pattern-5-longest-common-substring__grokking-dynamic-programming-patterns-for-coding-interviews
Topic | Replies | Views | Activity | |
---|---|---|---|---|
Top-Down solution Time Complexity |
![]() ![]() |
1 | 54 | July 6, 2022 |
Top-Down solution prev=-1 case |
![]() |
0 | 46 | June 3, 2022 |
I think the solution miss the edge cases |
![]() |
0 | 92 | December 2, 2021 |
Topic Correction - I believe this must be LIS instead of LDS! |
![]() ![]() ![]() ![]() ![]() |
7 | 558 | November 17, 2021 |
Alternative solution for longest bitonic sequence |
![]() ![]() |
1 | 155 | September 30, 2021 |
Pattern 5: Longest Common Substring - Longest Bitonic Subsequence - Clarification |
![]() |
0 | 196 | March 9, 2019 |
Is it correct to exclude the pivot element |
![]() ![]() ![]() |
2 | 280 | April 13, 2019 |