Find largest subset sharing a common digit

Q: Find largest subset sharing a common digit

This is a Coding & Algorithms interview question from Google for Software Engineer roles. View the full question and solution on PracHub.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

You are given a list of two-digit integers (each from 10 to 99, inclusive). You want to select as many numbers as possible in one selection such that:

There exists a digit d (0–9) where every selected number contains digit d in at least one position (tens or ones).

For example, from [11, 21, 31, 41, 16, 17, 18, 34, 57], you can select 11, 21, 31, 41, 16, 17, 18 (7 numbers) because they all contain digit 1.

Return the maximum possible size of such a selection.

Input

An integer array nums of length n , where each nums[i] is a two-digit integer ( 10 – 99 ).

Output

An integer: the maximum number of elements you can select.

Find largest subset sharing a common digit

Input

Output

Comments (0)