Infineon Technologies R&D Engineer Interview Questions and Answers

Q1. Find cycle in linked list
Ans. 
Detecting cycles in a linked list using Floyd's Tortoise and Hare algorithm
• Use two pointers - slow and fast

• If there is a cycle, the two pointers will eventually meet

• Time complexity is O(n) and space complexity is O(1)
Answered by AI
Add your answer

Q1. Opps concept and Linklist and tree are highly asked in Synopsys.
Add your answer
Q2. Reverse the linklist.
Ans. 
To reverse a linked list, iterate through the list and change the direction of pointers.
• Iterate through the linked list and keep track of the previous, current, and next nodes.

• Update the pointers of each node to reverse the direction.

• Set the head of the linked list to the last node encountered during iteration.
Answered by AI
Add your answer
Q3. Aptitude and Puzzle
Add your answer

Q1. Basics of digital design, verilog, and projects
Add your answer

Q1. Find leaves in a binary tree, left to right.
Ans. 
Traverse the binary tree using a queue to find leaves from left to right.
• Start by adding the root node to a queue

• While the queue is not empty, dequeue a node and check if it is a leaf node (both children are null)

• If it is a leaf node, add its value to the result array

• If it is not a leaf node, enqueue its children in left to right order
Answered by AI
Add your answer
Q2. Bfs in binary tree
Ans. 
Breadth-first search (BFS) is a traversal algorithm used to visit all nodes of a binary tree level by level.
• Start at the root node and visit all nodes at the current level before moving to the next level.

• Use a queue data structure to keep track of nodes to visit next.

• Example: BFS traversal of a binary tree - 1 -> 2 -> 3 -> 4 -> 5
Answered by AI
Add your answer

Q1. Html , Python , C++ theory and technical questions were asked.
Add your answer

Coding questions on Python , html , C++ and data structure. Also about database and SQL query.

Q1. This was the managerial round in which technical questions were also asked
Add your answer