How should I practice Exact String Matching?

Start by reading the full statement, solve the visible examples, then compare the pattern against related WhatNot phone screen problems in FastPrep.

Is Exact String Matching associated with WhatNot?

FastPrep tags this as a WhatNot phone screen coding practice problem when the problem catalog has that company and stage context.

WhatNot● MediumINTERNPHONE SCREEN

Given an array of strings dictionary and an array of strings queries, return one boolean for each query in the same order.

A query matches if it is exactly equal to at least one complete string in dictionary. Matching a prefix or substring alone is not sufficient.

Duplicate dictionary strings do not change the result.
The empty string is an ordinary string: it matches only if an empty string appears in dictionary.
Return an empty boolean array when there are no queries.

matchStrings(dictionary: String[], queries: String[]) → boolean[]

dictionary = ["cat","car","dog"]queries = ["cat","ca","cart","dog"]return = [true,false,false,true]

Only complete dictionary strings match. A prefix or a longer extension does not match.

dictionary = ["","a","a"]queries = ["","a","aa"]return = [true,true,false]

The empty string is present, and duplicate dictionary entries do not change membership.

dictionary = []queries = ["x",""]return = [false,false]

An empty dictionary contains no strings, including the empty string.

0 <= dictionary.length <= 500 and 0 <= queries.length <= 500.
Each string contains only lowercase English letters and has length from 0 to 40.
The total length of dictionary strings is at most 5000; the total length of queries is at most 5000.