Google·Software Engineer·Onsite - Coding / Algorithms
- Given an array of two-digit numbers (up to 100 elements), find the maximum size of a group where every number in the group shares at least one digit with at least one other number in the group.
“My first instinct was to just check pairwise digit overlap and greedily build groups, which completely fell apart once I thought about transitivity.”