Leetcode 3295. Report Spam Message

Given two string arrays, message and bannedWords, determine whether message contains at least two words that exactly match any word in bannedWords (return true if two or more matches, otherwise false). Arrays can be large (up to 1e5), so the core challenge is counting exact matches efficiently (e.g., via hash lookups).