Topics tagged longest-increasing-subsequence__pattern-5-longest-common-substring__grokking-dynamic-programming-patterns-for-coding-interviews

Topic	Replies	Views	Activity
Top-down DP "2D array" solution vs Bottom-up DP "1D array" solution Courses longest-increasing-subsequence__pattern-5-longest-common-substring__grokking-dynamic-programming-patterns-for-coding-interviews , grokking-dynamic-programming-patterns-for-coding-interviews__design-gurus	1	154	August 18, 2022
Path reconstructions for LIS Courses longest-increasing-subsequence__pattern-5-longest-common-substring__grokking-dynamic-programming-patterns-for-coding-interviews , grokking-dynamic-programming-patterns-for-coding-interviews__design-gurus	0	144	May 13, 2021
O(n log n) solution Courses longest-increasing-subsequence__pattern-5-longest-common-substring__grokking-dynamic-programming-patterns-for-coding-interviews , grokking-dynamic-programming-patterns-for-coding-interviews__design-gurus	1	400	November 18, 2020
Find the Subsequence of LCS,LIS Courses longest-increasing-subsequence__pattern-5-longest-common-substring__grokking-dynamic-programming-patterns-for-coding-interviews , grokking-dynamic-programming-patterns-for-coding-interviews__design-gurus	0	185	May 27, 2020