Cadence Design Systems Software Developer Intern Interview Questions and Answers

Round duration - 45 minutes
Round difficulty - Medium

The first Round was held on Hackerrank and the questions were of medium difficulty based on Data Structures and Algorithms.
The time of test was 1:00 PM and it was of 45 minutes with 2 coding questions to be solved.

Q1. Josephus
‘N’ people are standing in a circle numbered from ‘1’ to ‘N’ in clockwise order. First, the person numbered 1 will proceed in a clockwise direction and will skip K-1 persons including itself and w...read more
Ans. 
This question is about finding the position of the last person surviving in a circle of N people, where each person kills the Kth person in a clockwise direction.
• Implement a function that takes the number of test cases, N, and K as input

• For each test case, simulate the killing process by iterating through the circle and skipping K-1 people

• Keep track of the position of the last person surviving and return it as the outp
Answered by AI
View 2 more answers
Q2. Meetings II
Stark Industry is planning to organize Stark Expo, for which various departments have to organize meetings to check their preparations. Since Stark Tower has limited rooms available for the mee...read more
Ans. 
The task is to find the minimum number of conference rooms required to organize all the meetings.
• Sort the meetings based on their start time.

• Initialize a priority queue to store the end times of the meetings in ascending order.

• Iterate through the sorted meetings and check if the start time of the current meeting is greater than the end time of the meeting at the top of the priority queue.

• If it is, remove the meeting fr...read more
Answered by AI
View 3 more answers

Round duration - 75 minutes
Round difficulty - Medium

A google Doc was shared with us and we were supposed to write code there.
Use of IDEs was not allowed so we had to write correct code on Google Docs which was later checked by them through online IDEs.
The Interviewer were friendly and observative and helped us through code if we made some silly error.

Q1. Snake and Ladder
You have been given a Snake and Ladder Board with 'N' rows and 'N' columns with the numbers written from 1 to (N*N) starting from the bottom left of the board, and alternat...read more
Ans. 
The question is about finding the minimum number of throws required to reach the last cell on a Snake and Ladder board.
• The board is represented as a 2D matrix with N rows and N columns.

• Each square on the board can have a snake or ladder, represented by a non-negative number.

• The destination of a snake or ladder is the value at the corresponding square.

• You can only take a snake or ladder once per move.

• If the destination ...read more
Answered by AI
View 1 more answer
Q2. Largest rectangle in a histogram
You have been given an array/list 'HEIGHTS' of length ‘N. 'HEIGHTS' represents the histogram and each element of 'HEIGHTS' represents the height of ...read more
Ans. 
The task is to find the largest rectangle possible in a given histogram and return its area.
• Iterate through the histogram and maintain a stack to keep track of the indices of the bars in non-decreasing order of heights.

• For each bar, calculate the area of the rectangle that can be formed using that bar as the smallest bar.

• To calculate the area, pop the bars from the stack until a bar with a smaller height is encountered...read more
Answered by AI
View 4 more answers

Round duration - 60 minutes
Round difficulty - Easy

The face to face round was held on Google Meet where initially Interviewer asked a DS/Algo problem and then Later Manager Joined and asked about our resume projects in detail.
The time was 10:00 AM

Q1. Maximum sum rectangle
You are given an M X N matrix of integers ARR. Your task is to find the maximum sum rectangle.
Maximum sum rectangle is a rectangle with the maximum value for the sum of integers pr...read more
Ans. 
The task is to find the maximum sum rectangle in a given matrix of integers.
• Iterate through all possible rectangles in the matrix

• Calculate the sum of each rectangle

• Keep track of the maximum sum rectangle found so far

• Return the maximum sum
Answered by AI
View 2 more answers
Q2. XOR Query
Assume you initially have an empty array say ‘ARR’.
You need to return the updated array provided that some ‘Q’ number of queries were performed on this array.
The queries are of two types:
...read more
Ans. 
The problem requires updating an array based on a series of queries, where each query can either insert a value or perform a bitwise XOR operation on all elements.
• Use a loop to iterate through each query and update the array accordingly

• For type 1 query, append the value to the end of the array

• For type 2 query, perform a bitwise XOR operation on each element of the array with the given value

• Return the updated array afte
Answered by AI
View 3 more answers
Q3. Basic HR Questions
Tell one incident when you were not able to cooperate with your team member and how did you work together.
Why Texas Instrument , which is a Semiconductor Company ?
Ans. 
I had a disagreement with a team member over the approach to a project. We resolved it by discussing our perspectives and finding a middle ground.
• During a group project, my team member and I had different ideas on how to tackle a problem.

• We initially struggled to find common ground and it affected our collaboration.

• To resolve the issue, we scheduled a meeting to discuss our perspectives and understand each other's view...read more
Answered by AI
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

It was conducted in evening from 6 to 8 pm
Online live proctorong was there for which android phone was also needed along with laptop
This was the first round so i attended interview in the next round.

Q1. Team Formation
You are giving an interview, and you need to prove your intelligence. You will be given an array/list ‘ARR’ of ‘N’ positive integers, which are the runs scored by ‘N’ best players in the wor...read more
Ans. Brute Force
The basic idea of this approach is to iterate the whole ‘ARR’ from start and check for all the elements present after it. If the sum of the current pair is less than or equal to ‘X’ minus 30 then we will check if it is less than our temporary answer or not. If it is less then we will replace it with a temporary answer.
 
Here is the algorithm:
 
1. Declare a temporary array/list variable ‘ANS’ in which we...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 3 hrs
Round difficulty - Medium

It started from 9'o clock in the morning
It was conducted on webex meetings app.
The interviewer was very professional.

Q1. OS Questions
What is deadlock
Condition for Dead lock
Round robin scheduling algorithm
Job scheduler
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

It was in the evening

Q1. Basic HR Questions
What is the most difficult thing that you’ve ever accomplished? or What is the most difficult thing you have ever done?
What is the difference between hard work and smart work?
Add your answer

Q1. OOPS question to develop a fault-sensing algorithm in machines
Add your answer
Q2. Debug array question in bubble sort
Add your answer

General aptitude questions

Problem solving, solved 2 out of 3 questions

General topics were given in gd

Q1. Programming concepts
Add your answer
Q2. Projects and coding round questions solved
Add your answer

Technical plus aptitude based on domain you choose( pre placemt talks)

Q1. Communication theory , aptitude, electronics basics for firmware domain(screening)
Add your answer
Q2. Coding related questions
Add your answer

Q1. Circuits related practical questions
Add your answer

Q1. General things only
Add your answer

Profit and loss ,time and work ,speed distance and time

Java ,ops ,collection frameworks

2 problem was given to solve
1) Smallest Negative balance - -----%20America%20-%20Weekly%20Algorithm%20Challenges/Week%2021%20Algorithm%20Challenge/Smallest%20Negative%20Balance.md
2) Find the absolute difference between alpha & beta from the array.
Alpha -An element k in a array occurs k consecutive time
Beta - An element k in an array occurs k consecutive time starting from index k

Sample input
Arr[] = {2,2,2,4,4,4,4,1,2,2]
Output
Alpha - 3
Beta - 1
Absolute difference - 1

Note : consider array index starts with 1