Multiple strings collectively contain every string in array

I have a unique task that, I hope, has a simple answer...

I need to check whether a collection of separate strings (or text of each item in a listview subitem collection) collectively contain every string in another string array.

For example, I want to supply 1 or more strings in the form of a string array, search a listview, and return any listviewitems that contain all the strings in the first array, even if each string from the array is found in a different subitem. I don't necessarily expect to find one subitem that contains all strings in the array. I'm looking for something more like: subitems[3] contains array[1] and subitems[5] contains array[0], so return the listviewitem

Or, I suppose it could be thought of as searching through separate strings (subitems[0].text, subitems[1].text ...) instead of the text of a listview subitem collection.

Any ideas would be appreciated.

Thanks!

Obviously, this is a bit strange, and there must not be a straightforward answer...

Is there a better way to accomplish the same thing?

Maybe I'll try explaining it again and see if I can be clearer:

Listview has items; Items have several (maybe 6) subitems;

Given a string array with, say, 3 elements, return any Listview Item where every element in the string array is found within that items Subitems;

One of the Subitems contains one array element, another of the Subitems contains another array element, etc...; I do not expect every element to be found within the same subitem; I do not expect any matches to be in a specific order;

If every element is found within the Subitems of a Listviewitem, return that Listviewitem;

This could return multiple Listviewitems as well, since multiple Listviewitems could match the search criteria