Majority Element (More than n/2 times)
Filed under Persistent
The question
Given an array of size n, find the majority element that appears strictly more than n/2 times. Provide an optimal O(1) auxiliary space solution.
No write-up yet. Related questions below have one.
Related Persistent questions
Collected from public candidate posts and coding forums. Updated Nov 2026.