CodingMedium
Smallest subset of strings whose count exceeds half the array
Filed under MindTickle
The question
Given an array of strings, find the minimum number of distinct strings whose combined occurrences exceed half the array size (e.g. frequencies shoes 3, covid 3, face 2, pizza 1 in a 9-element array).
No write-up yet. Related questions below have one.
Related MindTickle questions
Collected from public candidate posts and coding forums. Updated Nov 2026.