Given two strings, find the length of their longest common subsequence. A subsequence keeps relative order. It doesn't need to be contiguous. Example: text1 = "abcde", text2 = "ace". Output: . The LCS is "ace". Example: text1 = "abc", text2 = "def". Output: . No common subsequence.
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
$ curl repovive.com/roadmaps/maang-interview-prep/dynamic-programming/problem-longest-common-subsequence
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░████████████████████████████████████████████████████████████████████████████████████████████████████████