LeetCode Experience

#315 Count of Smaller Numbers After Self

SWE coding Hard

Interview Experience

LeetCode #315: Count of Smaller Numbers After Self. Difficulty: Hard. Topics: Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set. Asked at Bloomberg 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

More from Bloomberg

Reddit What would you grind for Bloomberg? Reddit Bloomberg Tokyo Software Engineer Rejection after Five Rounds Reddit Bloomberg, senior C++ role – what to expect? 1p3a Bloomberg Fulltime SDE Interview Experience and Coding Challenges 1p3a Bloomberg SSE Bquant SF Interview Experience and Reject

← All Bloomberg questions Bloomberg Software Engineer Questions → All Arrays,Binary Search,Divide And Conquer,Binary Indexed Tree,Segment Tree,Merge Sort Questions →