Engineering college assignments never dies right??? So here's one! We were taught Kruskal's Algorithm as a part of DAA. And here's my hand's on approach to it. TBH I hate minimum spanning trees. Sorry ...

Given two strings text and pattern, return the index of the first occurrence of pattern in text, or -1 if pattern is not part of text. Use Rabin Karp algorithm to solve the problem. Given two strings ...