LeetCode Question

#32 Longest Valid Parentheses

SWE coding Hard

Sign in to bookmark Original →

Question Details

LeetCode #32: Longest Valid Parentheses. Difficulty: Hard. Topics: String, Dynamic Programming, Stack. 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

Stack Dynamic Programming Stack Strings

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