Write a function to find the length of the

longest common subsequencebetween two sequences.E.g. Given the strings “serendipitous” and “precipitation”, the longest common subsequence is “reipito” and its length is 7.

** Recursive approach** →

- Create two counters
`idx1`

and`idx2`

starting at 0. …