LeetCode Experience

#2426 Number of Pairs Satisfying Inequality

Interview Experience

LeetCode #2426: Number of Pairs Satisfying Inequality. Difficulty: Hard. Topics: Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set. Asked at Amazon in the last 6 months.

Original Source

This is a frequency-tagged signal. The full problem statement lives on the original source.

View original →

Topics

Binary Indexed Tree Divide And Conquer Merge Sort Ordered Set Segment Tree Arrays Binary Search Recursion Sorting