436. Find Right Interval - LeetCode Solution


Binary Search

Python Code:

class Solution:
    def findRightInterval(self, intervals: List[List[int]]) -> List[int]:
        s = sorted([(it[0], i) for i, it in enumerate(intervals)])
        ans = []    
        for it in intervals:
            i = bisect.bisect_left(s, (it[1], -1))
            ans.append(s[i][1] if i < len(s) else -1)
        return ans
        


Comments

Submit
0 Comments
More Questions

1093A - Dice Rolling
1360B - Honest Coach
1399C - Boats Competition
1609C - Complex Market Analysis
1657E - Star MST
1143B - Nirvana
1285A - Mezo Playing Zoma
919B - Perfect Number
894A - QAQ
1551A - Polycarp and Coins
313A - Ilya and Bank Account
1469A - Regular Bracket Sequence
919C - Seat Arrangements
1634A - Reverse and Concatenate
1619C - Wrong Addition
1437A - Marketing Scheme
1473B - String LCM
1374A - Required Remainder
1265E - Beautiful Mirrors
1296A - Array with Odd Sum
1385A - Three Pairwise Maximums
911A - Nearest Minimums
102B - Sum of Digits
707A - Brain's Photos
1331B - Limericks
305B - Continued Fractions
1165B - Polycarp Training
1646C - Factorials and Powers of Two
596A - Wilbur and Swimming Pool
1462B - Last Year's Substring