Mentor Graphics interview questions
Online test → Technical → Technical → HR → HR·62% entry level
DSA
Showing 42 of 79 reported in this area
Reverse a linked list in groups of K.
Check whether a binary tree is symmetric
Check whether a binary tree is a Sum Tree
Implement problems using DFS and recursion
Reverse a linked list in groups of size 2.
Explain BST search operation and BST Iterator
Print all root-to-leaf paths of a binary tree
Reverse a linked list in groups of given size
Traverse a given m x n matrix in spiral order.
Reverse a linked list in groups of given size k.
Perform vertical order traversal of a binary tree
Find the minimum element in a rotated sorted array.
Explain and implement Topological Sorting of a graph
Implement your own Binary Search Tree (BST) Iterator
Find the kth minimum element in a Binary Search Tree.
Implement an efficient algorithm to compute pow(x, n).
How would you check connectivity if the graph is directed?
Detect a cycle in a directed graph and an undirected graph.
Given an N-ary tree, find all paths from root to leaf nodes.
Explain the Knuth-Morris-Pratt (KMP) string matching algorithm
Given two coordinates, determine whether the two lines intersect
Re-solve written test coding questions considering all boundary cases
Given a BST, print all nodes which do not have siblings in preorder traversal.
Solve coding problems based on strings using optimal time and space complexity
For a given node in a binary tree, print its parent and sibling node if they exist.
Given an unsorted array, find the length of the longest contiguous subarray product.
Given a graph problem, design an algorithm, handle all base cases, and write the code
Reverse the words of a string in O(1) extra space (e.g., "i am a boy" → "boy a am i").
Find the path with minimum cost in a matrix from top-left corner to bottom-right corner
Given a matrix M where M(i,j)=1 if i is the parent of j, construct the corresponding tree.
Optimize counting bit changes in a 32-bit integer by reducing comparisons using extra space.
How would you search if both rows and columns of the 2D array are sorted in descending order?
Given a number and its index, determine if it is a valid index for that number in a Sudoku game
Given two arrays of sizes m and n (m >> n), find the common elements using an optimal algorithm.
Find the inorder successor of a node in a Binary Search Tree where each node has a parent pointer.
Given jobs with start time, end time, and CPU load, find the maximum CPU load at any time interval.
Print the level number along with each node while performing level order traversal of a binary tree.
Given a 2D array M where M[i][j] = 1 indicates i is the parent of j, construct the corresponding tree.
Given a number n, find the nearest smaller and greater numbers having the same number of set bits as n.
Search for a key in a 2D array where rows are sorted in ascending order and columns in descending order.
Given a binary tree, count the number of subtrees where all nodes in that subtree have the same data value.
Given n distinct integers and inequality signs between boxes, place the numbers to satisfy all inequalities.
CS fundamentals
Showing 11 of 27 reported in this area
Explain Object-Oriented Programming (OOPS) concepts in detail
Construct a 16:1 multiplexer using 4:1 multiplexers.
What are virtual functions and virtual destructors in C++?
Can a function be called before main() in C++? Explain possible ways.
Analyze time complexity of different approaches and justify the optimal one
Explain templates in C++ and write the syntax for declaring a generic class.
Given a logic circuit, identify the logic it represents and draw its truth table.
How do virtual functions work internally in C++? Explain VTABLE, VPTR, and compiler role.
Predict the output of a C program involving malloc, pointer arithmetic, strcpy, and printf.
What is the static keyword in C++ and how can non-static variables be accessed inside a static function?
Find errors and predict the output of a given C++ program involving object passing, const references, and pointers.
Puzzles
Showing 3 of 13 reported in this area
Measuring Block puzzle.
Count the total number of squares and rectangles on a chessboard.
Given 100 balls with one defective ball and a balance, find the minimum number of steps to identify the defective ball.
System design
Showing 3 of 4 reported in this area
Design a computer system with intelligence for the game Tic-Tac-Toe.
Write a function that returns a different string every time it is called, even when called simultaneously across different machines and processors.
Design a traffic signaling system and compute the average speed of vehicles; implement the solution in code
Behavioural
1 questions reported in this area
Answer behavioral questions assessing professional conduct
asked oncePractice this →
Showing 60 of 109 questions. Ranked by how often the same question came back across reports.
Practise a Mentor Graphics-style interview
A spoken interview built from these questions, scored when you finish; the report is yours.
Start practisingCommon questions
What questions does Mentor Graphics ask?
Candidate interview reports most often cover DSA (63%) and CS fundamentals (22%).
How many rounds does Mentor Graphics interview have?
Candidate interview reports show an average of 4.6 rounds per experience, with a typical sequence of Online test → Technical → Technical → HR → HR. Individual interview paths can vary.
Is the Mentor Graphics interview hard?
Among questions with a reported difficulty, the mix is easy 30%, medium 61%, hard 9%.