Rabin-Karp Algorithm for Pattern Searching [gssoc21]

[kavyasree-123]

💥 Proposal

Rabin-Karp Algorithm used for pattern searching The average and best-case running time of the Rabin-Karp algorithm is O(n+m), but its worst-case time is O(nm)

Have you read the Contributing Guidelines on Pull Requests?

yes i have read it carefully

[kavyasree-123]

To give a clear idea lets have inputs and outputs

Input: str[] = "abcdefghji" word[] = "abc" Output: Pattern is at position 1

[kavyasree-123]

want to work on this issue please assign it to me @bhav09 @HarshCasper @asthakri50

[bhav09]

@kavyasree-123, what is the programming language you would be implementing it on?

[kavyasree-123]

in c language

[bhav09]

Great, all the best!