[python] 2 heap greedy approach (O(nlogn) beats 80%, O(n)) - Find Right Interval - LeetCode

Editorial

Solutions (928)

All

JavaC++CPythonPython3JavaScriptGoSwiftScalaRustTypeScriptC#KotlinPHPBinary TreeBinary SearchSortingArrayHeap (Priority Queue)TreeHash TableTwo PointersOrdered SetOrdered MapSortDynamic ProgrammingStackGreedy