Loading Question...

Longest Valid Parentheses Substring - Inmobi Online Assessment MNNIT, Allahabad - Inmobi Interview Question | Codinzhub

Given a string s consisting only of the characters '(' and ')',

…

Given an array of values, determine the required result under the following conditions.

Input: [4, 8, 15, 16, 23, 42]

Output: 3

Constraints: 1 ≤ n ≤ 10⁵

Access the full question

Unlock the full statement, examples, constraints, and solution guidance.

solution.cpp

Run code to see test results

00:00 / 69:42

Longest Valid Parentheses Substring - Inmobi Online Assessment MNNIT, Allahabad

MediumMed•188 views

Given a string s consisting only of the characters '(' and ')',

…

Given an array of values, determine the required result under the following conditions.

Input: [4, 8, 15, 16, 23, 42]

Output: 3

Constraints: 1 ≤ n ≤ 10⁵

Unlock the full statement, examples, constraints, and solution guidance.

MediumMed•188 views

Asked at

Software Engineer

Expert in Data Structures & Algorithms. Building tools to help developers crack FAANG interviews.

Reviewed by Senior Engineers

Eternal • Pending

Inmobi • Pending

Inmobi • Pending

Inmobi • Pending

Squarepoint Capital • Pending

Last updated Sep 2026