K closest elements - 3 methods | gfg potd | GeeksForGeeks | Problem Of The Day | 21 May

21st May GeeksForGeeks Problem Of The Day - JAVA with all possible approaches and Code

Topics Wise
----------------------------------------------

Use code for 10% off on GFG : "AKSHAYS10"

----------------------------------------------
Reference Videos
1. Time complexity Logic of 10^8 -constraint analysis

You can follow me on below platforms for all the latest updates
----------------------------------------------
Instagram

Show Support
----------------------------------------------

Happy Coding 🤝.
.
.
.
Chapters
00:00 Understanding Question
07:39 Code Walkthrough

"Join me daily as we tackle the #ProblemOfTheDay from #GeeksforGeeks! Enhance your skills in #DataStructures and #Algorithms with our comprehensive #DSA tutorials. Perfect for those preparing for #CodingInterviews and looking to ace their #TechJobs. Dive into #CodingProblems, #CompetitiveProgramming, and #CodeChallenges with solutions in #C++/#Java/#Python. Stay ahead in your #InterviewPrep and #SoftwareEngineering journey. Don't miss out on our #CodingPractice sessions designed to help you master #DataStructuresAndAlgorithms. Follow for daily insights and tips on #Leetcode, #Hackerrank, and #Codeforces problems. #Programming #Coding #AlgorithmSolutions #CodeDaily."

#GFG #POTD #geeksforgeeks #problemoftheday #java
#AkshayAnil #dsa #code_with_akshay #dsa_with_akshay #dsasheet #programming #leetcodesolutions #gfg #gfgpotd #problemsolving #coding #softwareengineer #faang #amazon #microsoft #competitiveprogramming #dsasheet #interviewpreparation

[nishant]

i tried it without binary search using sets can you tell me why my code is not working

double &stations, int k) {
double d;multiset<double>st;
for(int i=1;i<stations.size();i++){

}
while(k--){



st.erase(--(st.end()));

}

double result = *(st.rbegin());
return floor(result * 100) / 100;







}

[undrrtd]

thoda question aur approach samjha bhi diya kijiye badhiya se video achha chalega