Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed before Aug 2023. There were 3 interview rounds.
Question on Recursion and Trees
Top trending discussions
posted on 11 Jun 2024
I applied via Referral and was interviewed before Jun 2023. There was 1 interview round.
I applied via Referral and was interviewed before Dec 2020. There were 3 interview rounds.
I was interviewed in Nov 2023.
F2F coding test which was pretty simple based on basic c++ concepts and few logical questions.
I applied via Campus Placement
Verilog coding of flip flops and FSM involves designing sequential circuits using Verilog HDL.
Understand the functionality of different flip flops like D flip flop, JK flip flop, etc.
Implement flip flops using Verilog syntax, specifying input and output ports.
Design Finite State Machines (FSM) using Verilog, defining states, transitions, and outputs.
Use Verilog constructs like always blocks, case statements, and state
I want to join Siemens because of its reputation for innovation and commitment to sustainability.
Siemens is a global leader in technology and innovation
I am impressed by Siemens' focus on sustainability and corporate social responsibility
I believe working at Siemens will provide me with opportunities for professional growth and development
posted on 4 Oct 2024
I applied via Referral and was interviewed in Sep 2024. There were 3 interview rounds.
Three DSA questions one on likedlist one on BST and one on maps
Smart pointers in C++ provide automatic memory management and help prevent memory leaks.
Smart pointers are objects that manage the memory of a pointer automatically.
They ensure that memory is deallocated when it is no longer needed.
Examples include unique_ptr, shared_ptr, and weak_ptr.
DSA questions on graph and lots of puzzles
I applied via Naukri.com and was interviewed in Jan 2022. There was 1 interview round.
Correct mislabelled jars by relabelling them with correct labels.
Identify the mislabelled jars
Check the correct labels for each jar
Remove the mislabelled label
Apply the correct label to the jar
Ensure all jars are correctly labelled
Reverse a number using recursion.
Define a recursive function that takes the number as input
Base case: if the number is less than 10, return the number
Recursive case: return the last digit of the number concatenated with the result of calling the function with the number divided by 10
Call the function with the input number
I was interviewed before May 2021.
Duration: 45 minutes
Topics: MCQ on C and C++, Quantitative Aptitude question from S. Chand and R.S. Agarwal
Question-related to current work.
Questions on data structure, and topics include link list and trees.
C++: Inheritance, Vtable, and templates.
I applied via LinkedIn and was interviewed in Nov 2023. There were 4 interview rounds.
To check if a directed graph is cyclic or not
Use Depth First Search (DFS) algorithm to traverse the graph
Maintain a visited set to keep track of visited nodes
Maintain a recursion stack to keep track of nodes in the current DFS traversal
If a node is visited and is already in the recursion stack, then the graph is cyclic
If DFS traversal completes without finding a cycle, then the graph is acyclic
Return a random byte from a stream of bytes with equal probability.
Create a variable to store the count of bytes read
Create a variable to store the current random byte
For each byte read, generate a random number between 0 and the count of bytes read
If the random number is 0, store the current byte as the random byte
Return the random byte
Check if a binary tree is a binary search tree or not.
Traverse the tree in-order and check if the values are in ascending order.
For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.
Use recursion to check if all nodes in the tree satisfy the above condition.
Algorithm to find Nth-to-Last element in a singly linked list of unknown length
Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning
Move both pointers simultaneously until the second pointer reaches the end of the list
The first pointer will be pointing to the Nth-to-Last element
If N=0, return the last element
Parse the list only once
Print all possible permutations of an array of integers
Use recursion to swap elements and generate permutations
Start with the first element and swap it with each subsequent element
Repeat the process for the remaining elements
Stop when all elements have been swapped with the first element
Print each permutation as it is generated
Design a stack that prints the minimum element pushed in O(1)
Use two stacks, one for storing elements and another for storing minimums
When pushing an element, compare it with the top of minimum stack and push the smaller one
When popping an element, pop from both stacks
To get the minimum element, just return the top of minimum stack
To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.
Use two pointers, one moving at twice the speed of the other.
When they meet, move one pointer to the head of the list and keep the other at the meeting point.
Move both pointers one step at a time until they meet again, which is the starting point of the loop.
To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.
Use binary search to find the number in each row and column
Start from the top-right corner or bottom-left corner to optimize search
Time complexity: O(m log n) or O(n log m) depending on the starting corner
based on 1 interview
Interview experience
based on 5 reviews
Rating in categories
Senior Member of Technical Staff
42
salaries
| ₹0 L/yr - ₹0 L/yr |
Member Technical Staff
19
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Staff Member Lead
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Cadence Design Systems
Synopsys
Mentor Graphics
Ansys Software Private Limited