Longest Common Subsequence

DSC-Banasthali-Vidyapith / Code-Crossroad

This project contains the carefully compiled Data Structures & Algorithm questions asked by the companies that visit Banasthali Vidyapith on-campus.

MIT License

55 stars 78 forks source link

Longest Common Subsequence #163

Open Anshika-Srivastava opened 2 years ago

Anshika-Srivastava commented 2 years ago

Aim: Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0.

I would like to provide my C++ code for the above mentioned problem statement. I would like to contribute under Hacktober Fest. Please assign me this issue. Thank You!

Anshika-Srivastava commented 2 years ago

@Vanshikagarg17 please assign me this

taranjotsingh23 commented 2 years ago

Hey, can I take up this issue? I'll do it in Java