Hi nodes welcome to my blog. I recently wrote about solving common Binary Tree problems in Java (preorder, inorder, postorder, and level order). One trick that helped me understand tree recursion was thinking about what each recuMar 4 · 1 min readmajorityelement.hashnode.dev
Boyer–Moore Majority Vote Algorithm.Approach Take two variable one is count another ans. Check count == 0 — it means the previous candidate has been balanced out by other elements. We no longer have a majority candidate, so we choose the current element as the new one. This ensures t...Sep 29, 2025 · 1 min readmajorityelement.hashnode.dev
