STRING MATCHING
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given two strings text and pattern, implement a function that finds all occurrences of pattern in the text using the Boyer-Moore string matching algorithm
+========+
Please answer to this message with your solution 🙂
>>Click here to continue<<