good

i tried it without binary search using sets can you tell me why my code is not working double findSmallestMaxDist(vector<int> &stations, int k) { double d;multiset<double>st; for(int i=1;i<stations.size();i++){ st.insert(abs(stations[i-1]-stations[i])); } while(k--){ st.insert((*(st.rbegin())/2)); st.insert((*(st.rbegin())/2)); st.erase(--(st.end())); } double result = *(st.rbegin()); return floor(result * 100) / 100; }

daily solution here thelogictutorial.blogspot.com/2024/05/find-pair-given-difference-17-may.html#google_vignette

*Promosm*

the code is not on replit. It's showing page not found.

Thanks a Lot

link is unclickable

thank you

Thanks ❤

Thank you❤

Thank you ❤

Thanks ❤

Thanks 💝

nice automation

Subscribe @gfgsolutions01 For More Videos Code File lInk : replit.com/@GFGSolutions/Addition-Of-Two-Integers#Main.java Follow Us On Instagram : instagram.com/gfg_solutions?igshid=YTQwZjQ0NmI0OA==

Keep it up bro 👍

Expected Time Limit

Wrong solution

🎉🎉👍🙏

ok thank you bro.

hi

I guess you've made your repository private that's why it's not visible on clicking the link

thankyou

❤