Skip to content

(17 XP) A function that finds the longest common substring of two strings.

License

Notifications You must be signed in to change notification settings

AppsLab2019/Open-Lab-04.13

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Open-Lab-04.13

(17 XP) A function that finds the longest common substring of two strings.

  1. Fork this repository to your GitHub account.
  2. Open solution file in Visual Studio.
  3. Open file StringTools.cs.
  4. Implement the method GetLongestCommonSequence(string str1, string str2) that finds the longest common substring of two strings.
  5. Run with CTRL+F5 to test it.
  6. If all tests are passed, commit & sync your repository.
  7. Send a link to your repository for Lab Master (in #slack) to check it.

Examples:

GetLongestCommonSequence("league", "legends")"le"
GetLongestCommonSequence("mojstryko", "cstrike")"str"

About

(17 XP) A function that finds the longest common substring of two strings.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages