Day 36 – DSA Practice 🚀 | LeetCode 169: Majority Element Another solid day in the DSA journey 🔥 Solved LeetCode 169 – Majority Element using the Boyer–Moore Voting Algorithm 🧠 Approach The majority ...
🚀 Day 83 of My DSA Journey Today I solved and revised two important array-based problems that helped me strengthen my understanding of greedy thinking and frequency-based patterns. 🧩 Problems ...
int arr[]={1,3,2,5,1,3,1,5,1}; ...
//Find the element that appears more than n/2 times in the array.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results