Problem Statement
Find the element that appears more than n/2 times.
Approach
Maintain a candidate and count. Increment for same element, decrement otherwise.
Time & Space Complexity
Time O(n), Space O(1).

The DSA Visualizer is designed for deep focus,
side-by-side code, and real-time execution insight.
On small screens, that level of clarity can't be preserved.
Open on a tablet (landscape) or desktop for the intended experience.
Desktop experience preview
Boyer-Moore voting algorithm for finding majority element.
Find the element that appears more than n/2 times.
Maintain a candidate and count. Increment for same element, decrement otherwise.
Time O(n), Space O(1).
Loading Interactive Visualizer...
Click "Play" or use arrow keys to step through the execution.