Two strings are specified, possibly of different lengths. The lengths of both lines are quite large (up to 3000 symbols). It is necessary to develop and implement an algorithm for finding the maximum length of a subsequence that is included in both specified strings. If there are several such lines, then give all of them.
I need description of algorithm and code on C#.
10 фрилансеров(-а) в среднем готовы выполнить эту работу за $17
Hi, I participate in many programming olympiads and solve many tasks like this, I also have many years experience with C# and I can easily do your task, provide you code and algorithm description in C#