Synopsys

30+ posts

Similar Topics

DSA

21k+ articles

Experiences

12k+ articles

Interview Experiences

11k+ articles

Amazon

1.8k+ articles

Microsoft

820+ articles

Samsung

330+ articles

Accolite

310+ articles

Snapdeal

150+ articles

FactSet

120+ articles

Brocade

10+ articles

Synopsys Interview Experience for R&D Engineer FTE (On-Campus)

Last Updated: 13 January 2021

First Round(Online Test):Section A: Computer Science MCQs(20 Ques)Section B: Aptitude(15 Ques)Section C: Electronics MCQs(8 Ques)No Negative Marking. All sections were Unt ...read more

Interview Experiences

Synopsys

On-Campus

Experiences

Efficiently merging two sorted arrays with O(1) extra space

Last Updated: 18 September 2023

Given two sorted arrays, we need to merge them in O((n+m)*log(n+m)) time with O(1) extra space into a sorted array, when n is the size of the first array, and m is the siz ...read more

Merge two sorted lists (in-place)

Last Updated: 10 January 2023

Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space).Examples:Input : head1: 5-7-9 head2: 4-6-8 Output : 4-5-6-7-8 ...read more

Merge two sorted arrays

Last Updated: 03 October 2023

Given two sorted arrays, the task is to merge them in a sorted manner.Examples:Input: arr1[] = { 1, 3, 4, 5}, arr2[] = {2, 4, 6, 8}Output: arr3[] = {1, 2, 3, 4, 4, 5, 6, 8...read more

Evaluation of Expression Tree

Last Updated: 10 March 2023

Given a simple expression tree, consisting of basic binary operators i.e., + , - ,* and / and some integers, evaluate the expression tree.Examples:Input: Root node of the ...read more

Merge two sorted arrays with O(1) extra space

Last Updated: 19 October 2023

We are given two sorted arrays. We need to merge these two arrays such that the initial numbers (after complete sorting) are in the first array and the remaining numbers a...read more

Find minimum number of coins to make a given value (Coin Change)

Last Updated: 20 October 2023

Given an array coins[] of size N and a target value V, where coins[i] represents the coins of different denominations. You have an infinite supply of each of coins. The ta ...read more

Merge two sorted linked lists

Last Updated: 10 July 2023

AuxiliaryGiven two sorted linked lists consisting of N and Mnodes respectively. The task is to merge both of the lists (in place) and return the head of the merged list.Ex...read more

How to determine if a binary tree is height-balanced?

Last Updated: 19 June 2023

A height balanced binary tree is a binary tree in which the height of the left subtree and right subtree of any node does not differ by more than 1 and both the left and r...read more

Merge an array of size n into another array of size m+n

Last Updated: 13 July 2023

There are two sorted arrays. First one is of size m+n containing only m elements. Another one is of size n and contains n elements. Merge these two arrays into the first a...read more

Lowest Common Ancestor in a Binary Search Tree.

Last Updated: 13 September 2023

Given two values n1 and n2 in a Binary Search Tree, find the Lowest Common Ancestor (LCA). You may assume that both values exist in the tree.Let T be a rooted tree. The lo...read more

Find the Maximum Depth or Height of given Binary Tree

Last Updated: 03 October 2023

Given a binary tree, the task is to find the height of the tree. The height of the tree is the number of vertices in the tree from the root to the deepest node.Note: The h...read more

1 2 3 >>

1 2 3 >>

1 2 3 >>