Siemens EDA(Mentor Graphics)
- Experience
- 4 years
- Posted
- 9 Jun 2025
Summary
I received a referral opportunity for Siemens EDA and completed two rounds of interviews. Unfortunately, I was unable to solve the 'Longest Valid Parentheses' problem in the second round, which resulted in a rejection.
How it went
Got an opportunity via referral
Total experience: 4 years
Round 1:
- Basics of C++
- Binary Search Tree (BST) question
- Finding 3 maximum elements in an array
- Bitwise operator questions
- More C++ fundamentals
- Medium Level Bitwise operator question
- Coding problem: Longest Valid Parentheses (Hard-level on LeetCode)
Wasn't able to solve the Longest Valid Parentheses problem in Round 2, which led to a rejection.
Questions asked (2)
- 01
Find Three Maximum Elements in an Array
Data Structures & Algorithms · Easy
Given an array, find the three maximum elements in it.
- 02
Longest Valid Parentheses
Data Structures & Algorithms · Hard
Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.