← Paytm questions

Modified Coin Change and Longest Balanced Braces Length

Filed under Paytm

Solve a modified dynamic programming coin change problem in O(n^2) time and find the length of the longest valid (well-formed) parentheses substring in O(n) time.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Paytm questions

Collected from public candidate posts and coding forums. Updated Nov 2026.