Find Right Interval | LeetCode 436 | C++, Java, Python

[@mahmoudtarek6859]

the way you convert from c++ to java to python is great.. people who get the idea and go away miss a priceless show.. XD

[@KnowledgeCenter]

😂

[@sudhirshinde2036]

A small suggestion:) we could have used only vector sorted, as we will not require the endpoint of the interval anywhere in the binary search, btw thanks for the daily videos!

[@KnowledgeCenter]

Good point!

[@crankyinmv]

Thanks as always. I had the idea to sort and store the original indices, but didn;t think to follow up with a binary search. A possible optimization would be cache by endpoint.

[@RishiRaj-dl1mg]

Sir i didn't get the last part of binary search...how did sorted[l] is returned at the end . Can you please explain?

[@0anant0]

Thanks! Can we use a hashmap: interval -> ori idx (as you have mentioned), and then save all intervals to a TreeMap/TreeSet and then use ceiling(end_time) for each interval?

[@KnowledgeCenter]

Yep. That should do.

[@hardikpatel352]

Thanks a lot