michaelrocks
val intersection = sets.firstOrNull()?.toHashSet() ?: return emptySet() for (i in 1..sets.lastIndex) { intersection.retainAll(sets[i]) if (intersection.isEmpty()) { break } } return intersection