[New Problem] Determine the maximum length of a subsequence of x that is also a substring of y

[AnimeshRajwar]

📝 New Problem Idea

Problem Title:
Determine the maximum length of a subsequence of x that is also a substring of y

Brief Statement:
Find the maximum length of a subsequence from string x that is also a substring of string y.
Return the length of this longest subsequence.

• Simple/Beginner
• Medium/Logic
• Hard/Optimized

Topic of this Problem

• String
• Subsequence
• Two pointer
• Dynamic Programming

[github-actions]

Thank you for raising this issue!

We'll review it as soon as possible. We truly appreciate your contributions! ✨

Meanwhile make sure you've visited the README.md, CONTRIBUTING.md, and CODE_OF_CONDUCT.md before creating a PR for this. Also, please do NOT create a PR until this issue has been assigned to you. 😊

[github-actions]

[AnimeshRajwar]

@shivamm-verma asked in microsoft online assesment

[AnimeshRajwar]

@shivamm-verma kindly accept this also

[AnimeshRajwar]

@shivamm-verma brother kindly accept this one , i am 9 points away from certification.

[shivamm-verma]

This issue doesn't seem important! @AnimeshRajwar