Cadence Design Systems interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Cadence Design Systems

2 rounds | 5 Coding problems

Shivangi Nagdewani

Fresher | May 2019

Selected

Interview preparation journey

Preparation

Duration: 5 Months

Topics: Data Structures and Algorithms, Object-Oriented Programming, System Design

Tip

Do practice a lot of questions on linked list and stacks as these are two most important data structures asked in the interview. Also, try to implement it yourself without seeing the solution. Also prepare for Computer Science subjects like Operating System, Database Management System, Computer Networks, etc. I prepared them through Coding Ninjas notes which were simpler and easy to understand.

Application process

Where: Linkedin

Eligibility: minimum 70 %

Resume tip

Keep your resume short and up to mark and check spellings before submitting it for the interview process.

Interview rounds

Round

Easy

Video Call

Duration30 minutes

Interview date1 Jan 2020

Coding problem3

1. Find a Node in Linked List

Easy

10m average time

97% success

0/40

Asked in companies

Searching of node in linked list.

Problem approach

Just traversed the linked list and find the node to be searched. Then the interviewer asked me if we can apply binary searc,h here I said yes but we have to sort the linked list first and then we can apply.

Try solving now

2. Detect loop

Moderate

15m average time

80% success

0/80

Asked in companies

Detect loop in Iinked list.

Problem approach

I gave the interviewer two-pointer concept of fast and slow pointers in which one pointer move double of other pointer and if these pointers meet then there is a loop in linked dlist.

Try solving now

3. Implement Stack with Linked List

Moderate

30m average time

73% success

0/80

Asked in companies

Implementation of stack using singly linked list.

Problem approach

I simply implemented pop and push operations of stack using insert and delete from front operations of linked list and wrote its fully functional code with comments.

Try solving now

Round

Easy

Video Call

Duration40 minutes

Interview date1 Jan 2020

Coding problem2

1. Top view

Moderate

42m average time

61% success

0/80

Asked in companies

Top view of binary tree.

Problem approach

Simply gave the interviewer level order approach with the concept of horizontal distance. We will store the first node having a particular horizontal distance in map and at last, the map will contain the required top view.

Try solving now