Skip to content

Collapse sidebar

Workspace

Keep growing

Your progress stays on this device. Export a backup in Settings.

Settings JCoderLevel 1 · 0 XP

ıWorkspaceVisualizer

The Path The problems Your desk About

Desk Path Problems Review

Boyer-Moore Majority Vote

arrays

Best O(n)Avg O(n)Worst O(n)Space O(1)

Preparing Boyer-Moore Majority Vote...

Identifies the candidate element that appears strictly more than n/2 times in O(1) space.