Algorithm · Google · Easy
You are given an array containing N two-digit integers. You may select a set of values from this array only when every selected value contains at least one digit that is common to the entire set. For instance, 47, 74, and 44 may be selected together because each includes digit 4, whereas 11, 47, and 23 may not be grouped because no single digit appears in all three values. Determine the greatest number of array entries that can be selected in one such group. Input: An…
Checking your access…