POTD- 01/11/2023 | Frequencies of Limited Range Array Elements

No video

POTD- 01/11/2023 | Frequencies of Limited Range Array Elements | Problem of the Day GeeksforGeeks

Рет қаралды 5,249

Күн бұрын

Welcome to the daily solving of our PROBLEM OF THE DAY with Karan Mashru. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Data Structures and Algorithms but will also help you build up problem-solving skills.
So come along and solve the GFG POTD of 01st November 2023 with us!
💻 Try it Yourself: www.geeksforge...
Find daily solutions for POTD here on our channel! Make sure you are subscribed and stay updated.
-----------------------------------------------------------------------------------------
🏆 Take part in our Weekly Coding Contests: practice.geeks...
📖 Master Competitive Programming - Complete Beginner to Advanced: practice.geeks...
-----------------------------------------------------------------------------------------
Follow us and stay updated on everything happening in the world of geeks:
📱 Twitter- / geeksforgeeks
📝 LinkedIn- / geeksforgeeks
🌐 Facebook- / geeksforgeeks.org
📷 Instagram- www.instagram....
#GFGPractice #GeeksforGeeks #ProblemofTheDay #CodingQuestions #POTD

Пікірлер: 9

@kumarqwerty4452 7 ай бұрын

Karan Mashru is the best teacher GfG has ever produced.Thanks man for wonderful explanation.

@miracleguy1330 Сағат бұрын

Easiest Solution -> int[] freq = new int[N + 1]; // Counting the frequency of each element for (int i = 0; i < N; i++) { if (arr[i]

@prateekbhaisora 9 ай бұрын

A cleaner code using modular arithematic: void frequencyCount(vector& arr,int n, int p) { p++; for(int i=0; i= n) continue; int cnt = arr[ind] / p; int ele = arr[ind] % p; cnt ++; arr[ind] = cnt * p + ele; } for (int i=0; i

@piyushphaske3271 7 ай бұрын

Thanks