Back to problems

Largest Group Sharing a Digit

Algorithm · Google · Medium

Requirements Input: a list of integers containing no more than 100 elements, where every element is a two-digit value from 10 through 99. A collection qualifies only when some digit d ∈ {0..9} occurs in every number within that collection. Return the size of the largest qualifying collection. Examples Notes Because a number contains no more than two unique digits, you need consider only the 10 possible digits. A repeated-digit value, such as 88, contributes just one unique…

Checking your access…