Neoalgo: Longest Common Subsequence Problem in DP

[Joshitha18]

💥 Proposal

Given two sequences, find the length of longest subsequence present in both of them. A subsequence is a sequence that appears in the same relative order, but not necessarily contiguous.

Have you read the Contributing Guidelines on Pull Requests?

yes

[Joshitha18]

I would like to work on it in C++ @Kajol-Kumari @Abhijit2505 as a part of HakinCodes

[NitikaGupta16]

I would like to work on it in C++ as a part of HakinCodes @Kajol-Kumari @Abhijit2505

[shubha028]

I would like to work on it using java as a part of HakinCodes .Please assign me this issue

[Kajol-Kumari]

Hey @Joshitha18 I think we already have it here If you proposal is different from what I pointed out, please feel free to put your points here.

[Joshitha18]

@Kajol-Kumari It's Longest increasing subsequence, this is longest common subsequence. Both are not same

[Kajol-Kumari]

I would like to work on it in C++ as a part of HakinCodes @Kajol-Kumari @Abhijit2505

Hey @Nitikagupta16 please choose any other language as c++ and java has already been take up

[yashsahay2014]

I would like to work on it in C as a part of HakinCodes 2020. Kindly assign me this issue.

[santushtisharma10]

@Kajol-Kumari @SKAUL05 I would like to work on this issue in Python

[shubha028]

@Kajol-Kumari I have made a pull request please check .

[yashsahay2014]

@Kajol-Kumari I have made a pull request. Kindly check it.

[github-actions[bot]]

Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Telegram or ping one of the reviewers. Thank you for your contributions!