Synopsys interview experience Real time questions & tips from candidates to crack your interview
Software Engineer
Synopsys
3 rounds | 9 Coding
problems
Selected Interview preparation journey
Journey
I have just followed Striver's Coding Sheet diligently. Those questions are enough to crack the interviews but not the coding exam. Therefore, it is better if you solve as many problems as you can.
Application story
I applied through On-campus Placements. The first round was an MCQ round, where the questions were mainly about OS, DBMS, C, and C++. This was followed by two technical rounds. In the first technical round, the questions were mostly basic coding questions, especially on Linked lists, and a few good questions from OS. The second round had questions mainly on Trees and my resume projects. The last round was the HR round.
Why selected/rejected for the role?
I had my basics clear and answered almost all the questions. One must be thorough with the basic coding questions and a few theoretical concepts of OS, such as memory management, disk management, and the difference between processes and threads (very important).
Preparation
Duration: 3 months
Topics: Operating Systems, DBMS, Algorithms, Dynamic Programming, Computer Networks
Tip 1: Start as early as possible.
Tip 2: Focus on OS and DBMS as well, along with coding.
Tip 3: Do not blindly look at the solution of a coding question. Try it out yourself.
Application process
Where: Campus
Eligibility: 7 CGPA
Tip 1: Mention the projects only if you have done them yourself.
Tip 2: Keep it simple.
Interview rounds
01
Round
Medium
Face to Face
Duration45 mins
Interview date17 Jul 2022
Coding problem5
The questions were mainly basic coding questions, such as LinkedList. There were a few questions from OS and DBMS as well. In OS, the questions were related to memory management and Process vs Threads.
1. Reverse Linked List
Moderate
15m average time
85% success
0/80
Asked in companies
Given a singly linked list of integers. Your task is to return the head of the reversed linked list.
For example:
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Follow Up :
Can you solve this problem in O(N) time and O(1) space complexity?
Problem approach
Straightforward question. I directly explained it to them in the most optimal way.
2. OS Questions
Explain memory management and disk management.
3. DS Question
Explain Stacks and Heaps memory. (Learn)
Problem approach
Tip 1: The basics of OS concepts would be enough to answer the OS-related questions.
5. Kth Largest Element in BST
Moderate
0/80
Asked in companies
Given the root node of a Binary Search Tree (BST), you have to return the Kth largest element in the BST.
For Example:
If K is 4 and the tree is depicted by the following image then,
The 4th largest element in the given BST is 1. So the output will be 1.
Follow-up :
Try to do it in O(1) space without using recursion.
Problem approach
I solved it using tree traversal. Inorder traversal gives the sorted array. Traverse the inorder traversal in reverse order and pick the kth position.
02
Round
Medium
Face to Face
Duration30 mins
Interview date17 Jul 2022
Coding problem3
Technical round taken by the manager.
1. Count Leaf Nodes
Easy
10m average time
90% success
0/40
Asked in companies
You are given a Binary tree. You have to count and return the number of leaf nodes present in it.
A binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child
A node is a leaf node if both left and right child nodes of it are NULL.
Problem approach
Directly explained the most optimal approach by traversing the tree. It’s not much of a difficulty if you have already practiced some basic tree-related questions. The base condition has been analyzed thoroughly.
3. Middle Of Linked List
Easy
20m average time
80% success
0/40
Asked in companies
Given a singly linked list of 'N' nodes. The objective is to determine the middle node of a singly linked list. However, if the list has an even number of nodes, we return the second middle node.
Note:
1. If the list is empty, the function immediately returns None because there is no middle node to find.
2. If the list has only one node, then the only node in the list is trivially the middle node, and the function returns that node.
Problem approach
There are two ways. One is by finding the length of the linked list and then traversing to the middle of the length. The second is the optimal way, using the two-pointer approach. It's a very basic question on linked lists.
03
Round
Easy
HR Round
Duration10 mins
Interview date17 Jul 2022
Coding problem1
Nothing technical in this round; the HR just confirmed my job location.
1. Basic HR Questions
I was informed about my job location and package details.
Introduce yourself.
Why do you want to join Synopsys?
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 5 problems
Interviewed by Synopsys
Selected 
3080 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by Synopsys
Rejected
1780 views
0 comments
0 upvotes
SDE - Intern
2 rounds | 5 problems
Interviewed by Synopsys
Rejected
1705 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Synopsys
Selected 1682 views
0 comments
0 upvotes
Companies with similar interview experiences
Software Engineer
4 rounds | 1 problems
Interviewed by Newgen Software
Selected 3210 views
2 comments
0 upvotes
Software Engineer
3 rounds | 6 problems
Interviewed by HashedIn
Selected 2582 views
0 comments
0 upvotes
Software Engineer
2 rounds | 2 problems
Interviewed by Ernst & Young (EY)
Selected 0 views
0 comments
0 upvotes