LeetCode Question

#300 Longest Increasing Subsequence

SWE coding Medium
Sign in to bookmark Original →

Question Details

LeetCode #300: Longest Increasing Subsequence. Difficulty: Medium. Topics: Array, Binary Search, Dynamic Programming. 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 Binary Search Dynamic Programming

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,Dynamic Programming Questions →