Jan 2 · 3 min read · LeetCode 961: N-Repeated Element in Size 2N Array is usually solved with a simple Hash Set (O(N) space) or randomized checks. But recently, I challenged myself to solve it deterministically using O(1) space. The result? A modified version of Moore’s ...
Join discussion
Feb 20, 2025 · 2 min read · Finding the Majority Element: Brute Force vs. Moore's Voting Algorithm The Majority Element problem asks us to find the element that appears more than half the time in a given array. Let's explore two approaches: brute force and Moore's Voting Algori...
Join discussionJul 4, 2024 · 2 min read · Working Let the initial length be 1, because we are considering the first element as the initial element in our count. Move forward in the array and if the same element appears again, then increase the count by 1; if not, then decrease the count by...
Join discussionOct 23, 2023 · 3 min read · Problem Problem Link Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. Example 1: Input: nums = [3,2,3] Output: [3] Example 2: Input: nums = [1] Output: [1] Example 3: Input: nums = [1,2] Output: [1,2] Moore'...
Join discussion
Oct 13, 2023 · 5 min read · Problem Given an array nums of size n, return the majority element. The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array. Problem Link Example 1: Input: nums = [...
Join discussion