Interview Experience
LeetCode #493: Reverse Pairs. Difficulty: Hard. Topics: Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set. Asked at Google 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