Algo_ds_101: Sublist_Search

[ahampriyanshu]

Submission Title
Sublist_Search

Submission Type
Algorithm

Submission Description
Sublist Search : We first take first node of second list, start matching the first list from this first node, if whole lists match return true, else break and take first list to the first node again and take second list to its second node. Repeat these steps until any of linked lists becomes empty. If first list becomes empty then list found else not.

Submission Directory

Algorithms => Search_Algorithms => Sublist_Search => Sublist_Search.extension

Contributors

• [x] C++ -
• [ ] C -
• [x] Python -
• [x] Java -
• [ ] JavaScript -
• [ ] TypeScript -
• [ ] Golang -
• [ ] Ruby -
• [ ] php -
• [ ] Swift -
• [ ] C# -

[reyadkhan]

I would like to do it in php

[omarahmed1111]

I would like to implement this in js

[Kadermiyanyedi]

I would like to implement this in C ?

[shwhite17]

i would like to implement in c language

[ahampriyanshu]

i would like to implement in c language

Hi @shwhite17,
Please opt a different language/issue.

[harlansgs]

Please assign me this for Ruby.

[ahampriyanshu]

thanks everyone :v: