- Dynamic Programming: Subproblem method of approach possible - possible overlapping sub problems occurence - Dynamic Progamming it is!
- Recursive and Memoized (TopDown) - break into subproblems to solve to a solution
- Start from subproblems and move to a solution (BottomUp)
- Max slows down - check this
- global var faster access - check this @https://www.hackerrank.com/challenges/common-child/forum
- https://www.geeksforgeeks.org/space-optimized-solution-lcs/
- https://www.geeksforgeeks.org/longest-common-subsequence/
- TusharRoy Video on LCS - https://www.youtube.com/watch?v=NnD96abizww