 Open in App
Not now

# Mentor Graphics Interview Experience 2019 | On-Campus

• Last Updated : 27 Aug, 2019

Round 1 : Aptitude + Technical + Coding Section

• The first section was Aptitude consisting of 20 questions to be solved in 20 minutes.

The technical section could be done in JAVA/C++ only.Once chosen the language the same language need’s to be followed for technical + coding sections.

Round 2 : 20 people were shortlisted for the interview
This round a one-to-one personal interview which was 100% coding based.
I was asked the following questions :

• Root to leaf path of a binary tree.
• Check if binary tree is a sum tree.
• Vertical Order Traversal in a binary tree.
• Given an number and it’s index find if it’s a valid index for that number in the game of Sudoku.
• Given two coordinated find if the lines intersect.

Round 3 : Advanced Coding Round
This section began with a “Tell me about yourself question”. In this round we were expected to find the most optimal solution for a given problem statement. The questions asked were based on dynamic programming.
For Example : Given an array of cost price and selling price of an item find the day when the item must be bought and sold in-order to make maximum profit. The selling price must be on the right side of cost price in the array.The maximum time complexity O(n).
Round 4 : HR Round
This round began with a basic set of questions like:
– How long can we expect you to for if hired.
– Questions for family background.
– Why do you want to work for us etc.

It also consisted of one puzzle : https://puzzling.stackexchange.com/questions/16643/connecting-blue-dots-to-red-dots
The complexity of this problem was increased by :
1. Prove using induction that a triangle can be formed in this place with all points of the same colour
2. Prove using induction that a polygon can be formed in this plane with all points of the same colour.
Round 5 : Final Round
The final round was again an HR round which included questions like :