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 IBM 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 IBM

Reddit Ibm sde intern 1p3a IBM AI Developer Entry Level Interview Questions: REST API and LeetCode 1p3a IBM Java Backend Online Assessment on HackerRank Experience 1p3a IBM Platform Intern Technical Phone Screen - SDE Internship Reddit Advice for Legacy App Migration

← All IBM questions IBM Software Engineer Questions → All Stack Questions →