Synopsys interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Synopsys

2 rounds | 4 Coding problems

Anonymous

Fresher | Sep 2022

Rejected

Interview preparation journey

Preparation

Duration: 3 months

Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming

Tip

Tip 1 : OOPS - You should be well versed with basic OOPS principles
Tip 2 : You should be confident and have profound knowledge about the projects you worked on
Tip 3 : Basic DB concepts like joins, normalisation

Application process

Where: Other

Eligibility: Above 6 CGPA

Resume tip

Tip 1 : Have clean resume with projects mentioned separately
Tip 2 : Internships should be mentioned if done

Interview rounds

Round

Medium

Video Call

Duration45 minutes

Interview date9 Sep 2022

Coding problem2

1. Convert binary tree to mirror tree

Easy

15m average time

85% success

0/40

Asked in companies

Given a binary tree, convert this binary tree into its mirror tree.

A binary tree is a tree in which each parent node has at most two children.

Mirror of a Tree: Mirror of a Binary Tree T is another Binary Tree M(T) with left and right children of all non-leaf nodes interchanged.

Note:

1. Make in-place changes, that is, modify the nodes given a binary tree to get the required mirror tree.

Problem approach

Given a binary tree, convert this binary tree into its mirror tree.
A binary tree is a tree in which each parent node has at most two children.
Mirror of a Tree: Mirror of a Binary Tree T is another Binary Tree M(T) with left and right children of all non-leaf nodes interchanged.

Try solving now

2. Palindrome Partitioning

Moderate

25m average time

75% success

0/80

Asked in companies

You are given a string 'S'. Your task is to partition 'S' such that every substring of the partition is a palindrome. You need to return all possible palindrome partitioning of 'S'.

Note: A substring is a contiguous segment of a string.

For Example:

For a given string “BaaB”
3 possible palindrome partitioning of the given string are:
{“B”, “a”, “a”, “B”}
{“B”, “aa”, “B”}
{“BaaB”}
Every substring of all the above partitions of “BaaB” is a palindrome.

Problem approach

Given a string ‘str’. Find the minimum number of partitions to make in the string such that every partition of the string is a palindrome.
Given a string, make cuts in that string to make partitions containing substrings with size at least 1, and also each partition is a palindrome. For example, consider “AACCB” we can make a valid partition like A | A | CC | B. Among all such valid partitions, return the minimum number of cuts to be made such that the resulting substrings in the partitions are palindromes.
The minimum number of cuts for the above example will be AA | CC | B. i.e 2 cuts
Note :
1) We can partition the string after the first index and before the last index.

2) Each substring after partition must be a palindrome.

3) For a string of length ‘n’, if the string is a palindrome, then a minimum 0 cuts are needed.

4) If the string contains all different characters, then ‘n-1’ cuts are needed.

5) The string consists of upper case English alphabets only with no spaces.

Try solving now

Round

Medium

Video Call

Duration45 minutes

Interview date9 Sep 2022

Coding problem2

1. Leaders in an array

Easy

15m average time

90% success

0/40

Asked in companies

Given a sequence of numbers. Find all leaders in sequence. An element is a leader if it is strictly greater than all the elements on its right side.

Note:

1. Rightmost element is always a leader.

2. The order of elements in the return sequence must be the same as the given sequence

Example:

The given sequence is 13, 14, 3, 8, 2 .

13 Not a leader because on the right side 14 is greater than 13.

14 lt is a leader because no one greater element in the right side.

3 Not a leader because on the right side 8 are greater than 3.

8 It is a leader because no one greater element on the right side.

2 It is a leader because it is the rightmost element in a sequence.

Hence there are 3 leaders in the above sequence which are 14, 8, 2.

Problem approach

Given a sequence of numbers. Find all leaders in sequence. An element is a leader if it is strictly greater than all the elements on its right side.
Note:
1. Rightmost element is always a leader.
2. The order of elements in the return sequence must be the same as the given sequence

Try solving now