Turing

Online Assessment
Online Assessment//Valid Parentheses
Q2
Easy50 Marks

Valid Parentheses

StringStack
Set 1 • 90 min
Problem Statement

In Turing's technical coding assessment, candidates are evaluated on clean algorithmic problem-solving for "Valid Parentheses".

Given standard input parameters adhering to String principles, design an optimal algorithm that satisfies all constraints and handles boundary test scenarios efficiently.

Ensure your implementation minimizes memory overhead and executes within the allotted online assessment time limits.

Candidate Instructions
  • ▸Identify the core invariant related to String.
  • ▸Verify edge cases including empty inputs and extreme bounds.
  • ▸Optimize time complexity before submitting.
Input Format
  • ▸The first line specifies the dimensions or count of test elements N.
  • ▸The subsequent line(s) contain the input array, string, or graph representation.
Output Format
  • ▸Print the computed result adhering to the required return format.
Constraints
  • 1 <= N <= 10^5
  • -10^9 <= element[i] <= 10^9
  • Time Limit: 2.0 seconds
  • Memory Limit: 256 MB
Edge Cases
  • ▸Empty or single-element input
  • ▸Input containing maximum or minimum boundary values
  • ▸Uniform elements or all-negative test cases
Sample Test Cases
Example 1
Input
nums = [2, 7, 11, 15], target = 9
Output
[0, 1]
Explanation

Applying the optimal String approach yields the expected solution [0, 1].

Complexity
TimeO(N)
SpaceO(N)
Expected Approach

Leverage String combined with Stack to process the input in optimal O(N) time complexity.