Cadence Design Systems SDE-2 Interview Questions and Answers

Q1. Inheritancebased question, virtual function 2 times called
Add your answer
Q2. Sort and array in user defined order
Ans. 
Sort an array of strings based on a user-defined order.
• Define the custom order as a string, e.g., 'cba'.

• Create a mapping of characters to their indices for quick lookup.

• Use a sorting function that utilizes the mapping to sort the array.

• Example: For array ['a', 'b', 'c'] and order 'cba', the result should be ['c', 'b', 'a'].
Answered by AI
Add your answer
Q3. Median from stream of integers
Ans. 
Efficiently finding the median from a stream of integers requires maintaining a balanced data structure for dynamic data.
• Use Two Heaps: Maintain a max-heap for the lower half and a min-heap for the upper half of the numbers to efficiently find the median.

• Insertion: When a new number is added, decide which heap to insert it into based on its value relative to the current medians.

• Balancing Heaps: After each insertion, en...read more
Answered by AI
Add your answer
Q4. Smart Pointer and all types
Add your answer
Q5. Copy contructor
Ans. 
A copy constructor creates a new object as a copy of an existing object, ensuring proper resource management.
• A copy constructor is a special constructor in C++ that initializes an object using another object of the same class.

• Syntax: ClassName(const ClassName &obj) { /* copy data */ }

• Used for deep copying when an object contains pointers to dynamically allocated memory.

• Example: If class A has a pointer, the copy co...read more
Answered by AI
Add your answer
Q6. Shallow and deep copy
Add your answer
Q7. Tree taversals all types
Ans. 
Tree traversals are methods for visiting all nodes in a tree data structure, including pre-order, in-order, post-order, and level-order.
• Pre-order Traversal: Visit root, then left subtree, then right subtree. Example: For tree (A, B, C), output is A, B, C.

• In-order Traversal: Visit left subtree, then root, then right subtree. Example: For tree (A, B, C), output is B, A, C.

• Post-order Traversal: Visit left subtree, then ri...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Standard Data Structures and Algorithms round . One has to be fairly comfortable in solving algorithmic problems to pass this round with ease.

Q1. 
Find All Pairs with Given Sum
Given an integer array arr and an integer Sum, count and return the total number of pairs in the array whose elements add up to the given Sum.
Input:
The first line contain...read more
Ans. 
Count and return the total number of pairs in the array whose elements add up to a given sum.
• Use a hashmap to store the frequency of each element in the array.

• Iterate through the array and for each element, check if (Sum - current element) exists in the hashmap.

• Increment the count of pairs if the complement exists in the hashmap.
Answered by AI
Add your answer
Q2. 
Minimum Number of Jumps Problem
Given an array ARR of N integers, determine the minimum number of jumps required to reach the last index of the array (i.e., N - 1). From any index i, you can jump to an in...read more
Ans. 
The problem involves finding the minimum number of jumps required to reach the last index of an array, where each element indicates the maximum distance that can be jumped from that position.
• Use a greedy approach to keep track of the farthest reachable index and the current end of the jump.

• Iterate through the array, updating the farthest reachable index and incrementing the jump count when necessary.

• Return the jump cou...read more
Answered by AI
Add your answer

Round duration - 70 minutes
Round difficulty - Medium

This round was preety intense and went for over 1 hour . I was asked 2 preety good coding questions (one was from Graphs and the other one was from DP) . After that I was grilled on my Computer Networks and Operating System concepts but luckily I was able to answer all the questions and the interviewer was also quite impressed.

Q1. 
Two Teams (Check Whether Graph is Bipartite or Not)
Determine if a given undirected graph can be divided into exactly two disjoint cliques. Print 1 if possible, otherwise print 0.
Input:
The first line ...read more
Ans. 
Check if a given undirected graph can be divided into exactly two disjoint cliques.
• Create an adjacency list to represent the graph

• Use BFS or DFS to check if the graph is bipartite

• If the graph is bipartite, it can be divided into two disjoint cliques
Answered by AI
Add your answer
Q2. 
Maximum Length Pair Chain Problem
You are provided with 'N' pairs of integers, where the first number in each pair is less than the second number, i.e., in pair (a, b) -> a < b. A pair chain is defi...read more
Ans. 
Find the length of the longest pair chain that can be formed using the provided pairs.
• Sort the pairs based on the second number in each pair.

• Iterate through the sorted pairs and keep track of the maximum chain length.

• Update the maximum chain length based on the conditions given in the problem statement.
Answered by AI
Add your answer
Q3. Can you explain the TCP/IP Protocol?
Ans. 
TCP/IP is a set of rules governing the exchange of data over the internet.
• TCP/IP stands for Transmission Control Protocol/Internet Protocol.

• It is a suite of communication protocols used to connect devices on the internet.

• TCP ensures that data is delivered reliably and in order, while IP handles the addressing and routing of data packets.

• Examples of TCP/IP applications include web browsing (HTTP), email (SMTP), and file...read more
Answered by AI
Add your answer
Q4. Can you explain the DHCP Protocol?
Ans. 
DHCP Protocol is used to automatically assign IP addresses to devices on a network.
• DHCP stands for Dynamic Host Configuration Protocol

• It allows devices to obtain IP addresses and other network configuration information dynamically

• DHCP servers assign IP addresses to devices for a specific lease period

• DHCP uses a client-server model where the client requests an IP address and the server assigns one

• DHCP uses UDP port 67 f...read more
Answered by AI
Add your answer
Q5. What is meant by multitasking and multithreading in operating systems?
Ans. 
Multitasking involves running multiple tasks concurrently, while multithreading allows multiple threads within a single process to run concurrently.
• Multitasking allows multiple processes to run concurrently on a single processor, switching between them quickly.

• Multithreading allows multiple threads within a single process to run concurrently, sharing resources like memory and CPU time.

• Multitasking is at the process lev...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Hard

This round majorly focused on past projects and experiences from my Resume and some standard System Design + LLD questions + some basic OOPS questions which a SDE-2 is expected to know .

Q1. How would you design a system like Pastebin?
Ans. 
Design a system like Pastebin for sharing text snippets
• Use a web application framework like Django or Flask for the backend

• Store text snippets in a database like MySQL or MongoDB

• Generate unique URLs for each snippet to share with others

• Implement features like syntax highlighting, expiration time, and password protection

• Consider implementing user accounts for managing and organizing snippets
Answered by AI
Add your answer
Q2. What is data abstraction and how can it be achieved?
Ans. 
Data abstraction is the process of hiding implementation details and showing only the necessary features of an object.
• Data abstraction can be achieved through classes and objects in object-oriented programming.

• It involves creating a class with private data members and public methods to access and modify those data members.

• By using data abstraction, users can interact with objects without needing to know the internal wo...read more
Answered by AI
Add your answer
Q3. What is the Diamond Problem in C++ and how can it be resolved?
Ans. 
Diamond Problem is a common issue in multiple inheritance in C++ where a class inherits from two classes that have a common base class.
• Diamond Problem occurs when a class inherits from two classes that have a common base class, leading to ambiguity in accessing members.

• It can be resolved in C++ using virtual inheritance, where the common base class is inherited virtually to avoid duplicate copies of base class members.

• ...read more
Answered by AI
Add your answer
Q4. What are friend functions in C++?
Ans. 
Friend functions in C++ are functions that are not members of a class but have access to its private and protected members.
• Friend functions are declared inside a class with the keyword 'friend'.

• They can access private and protected members of the class they are friends with.

• Friend functions are not member functions of the class.

• They can be standalone functions or functions of another class.

• Example: friend void displayD...read more
Answered by AI
Add your answer