-
-
Notifications
You must be signed in to change notification settings - Fork 6.3k
Open
Description
93. Consider two arrays A and B of shape (8,3) and (2,2). How to find rows of A that contain elements of each row of B regardless of the order of the elements in B? (★★★)
Does it mean that expected rows of A only need contain at least one element from each row of B?
In other words, expected rows of A are not necessary to contain every element from each row of B, which I initially thought? or the answer will not make sense.
Take the following as the example
the 7th row of A is [2, 4, 1],which contains 2 coming from 0th row of B and 1 coming from 1th row of B. Obviously [2,4,1] doesn't contain 3 which is the element of 0th row of B.
If my current thought is correct, I want to complain about the description of Q93. I think "at least one or more" should be added up to description in the midst of "contain elements"
Metadata
Metadata
Assignees
Labels
No labels