LeetCode Question

#2461 Maximum Sum of Distinct Subarrays With Length K

SWE coding Medium

Question Details

LeetCode #2461: Maximum Sum of Distinct Subarrays With Length K. Difficulty: Medium. Topics: Array, Hash Table, Sliding Window. 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

Arrays Hash Table Sliding Window

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,Hash Table,Sliding Window Questions →