Frequency of the Most Frequent Element | LeetCode | Binary search | Sliding window | Prefix sum |DSA

[@LeelaLakshmiKundi]

Great way of explaining ......Keep doing🙏🙏Thank you so much

[@sauravchandra10]

I was missing the sliding window part, thanks for explaining it so clearly!

[@vcs649]

Excellent work

[@Ajay-k5i]

Nice explanation with great approach

[@anug14]

thanks using prefix sum directly is more readable for me: public int maxFrequency(int[] nums, int k) { Arrays.sort(nums); int n = nums.length; // prepare prefix sum int[] pre = new int[n]; pre[0] = nums[0]; for(int i = 1; i < n; i++){ pre[i] += pre[i - 1] + nums[i]; } // start binary search int ans = 1; int l = 1; int r = n; while(l

[@sumanthvarma1908]

Excellent explanation Thank you

[@iamnoob7593]

Thanks Man , I Understood , But main key part is to understand why sorting is required and why sliding window is required .

[@shivamuniyal9274]

agreed 🙂

[@Amansharma-dr6cx]

Keep it up man, clean approach and solution.

[@adityarajiv6346]

Thanks😀. Please share the channel with all your friends and subscribe 👍

[@ankitsharda1131]

Superb explanation man!!

[@kumarabhishek9477]

Nice approach and explanation. Keep the good work going.

[@aftabhaider8556]

very good approach

[@the_amey_parashar]

why did we apply binary search?

[@kalyan539]

hey one doubt at 16.31 time u said 7+4=11 [1,4,8] range ..i didnt get which operations u did!

[@lover_of_u3455]

Means (8-1)+(8-4)=7+4=11

[@lover_of_u3455]

To make 1 and 4 equal to 8 we have to increase 1 by 7 operation and increase 4 by 4 operation. Total operations required to make all the element equal to 8 is 11

[@ajitpalsingh9805]

great approach man keep it up

[@shivamaggarwal7357]

i converted your code in java and it is not working??? please write a java code

[@AbhishekRaj-vr8rb]

thanks bhaiya...

[@adityarajiv6346]

Welcome😀👍. Please share the channel with all your friends 👍

[@ankit_yadav11]

bhai runtime error q aa rha h line by line match kar chuka hun ayar

[@ananypandey1310]

what does 1LL represent ?

[@adityarajiv6346]

long long int

[@Randomuser7890]

why are we sorting???

[@lover_of_u3455]

Since we can only increase the number by 1 and we need all the element that were less than target so that with the help of k operations we can make them equal to the target value value that's why we sort it