Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

Infineon Technologies interview experience Real time questions & tips from candidates to crack your interview

Infineon Technologies

3 rounds | 6 Coding
problems

Journey

I was not a bright student in college, but I always worked hard to get a recognized job. I had no particular interests in college, but I still did coding and machine learning.

Application story

I learned about the openings and that the company's hiring drive will visit our college to hire candidates as Data Engineers. I did great in the selection process and got the offer letter.

Why selected/rejected for the role?

I had the appropriate skills and knowledge to prove I was the right man for the post. I also optimally solved coding questions.

Preparation

Duration: 5 months

Topics: Topics: Data Structures, Pointers, OOPS, Algorithms, DBMS, Puzzles.

Tip

**Tip 1:** Search for top interview questions on your topic on Google and read them thoroughly.

**Tip 2:** Be prepared for general questions as well. For example, "Tell me something about yourself," "Why do you want to join?" "What do you know about the company?" etc.

**Tip 3:** Practice as many questions as you can, as this will help you build logic in a short time.

**Tip 4:** Complete at least two projects.

Application process

Where: Campus

Eligibility: Above 7 CGPA

Resume tip

Tip 1: Make concise, to-the-point statements in your resume.

Tip 2: Mention your projects, skills, and experiences in detail.

01

Round

Medium

Video Call

Duration60 minutes

Interview date20 Nov 2022

Coding problem2

```
For the given binary tree
```

```
The level order traversal will be {1,2,3,4,5,6,7}.
```

Problem approach

**Step 1:** Create an empty queue that accepts BinaryTreeNode.

**Step 2:** Put the root of the binary tree in the queue.

**Step 3:** Loop while the queue is not empty:

**3a:**Store the current size of the queue, which will help us know how many nodes need to be printed at one level.**3b:**Dequeue the first node from the queue.**3c:**Print its data.**3d:**If the dequeued node has a left or right child, enqueue it to the queue.**3e:**Print a line as we move to the next level.

```
1. The given node 'TARGET_NODE_VAL' is always present in the tree.
2. The value of each node in the tree is unique.
3. Notice that the Kth ancestor node if present will always be unique.
```

Problem approach

I solved this question recursively.

Step 1: Find the given node in the tree.

Step 2: If the node is not found, simply return null. Otherwise, check if K is greater than 0. If yes, that means we haven't found the Kth ancestor, so we decrement the value of K. Also, check if K is 0. If it is, we have found the Kth ancestor, so we print it, return null, and if the root is null, we return.

02

Round

Medium

Face to Face

Duration60 minutes

Interview date4 Dec 2022

Coding problem2

```
You need to modify the given tree only. You are not allowed to create a new tree.
```

```
For the given binary search tree
```

```
11 will be replaced by {15 + 29 + 35 + 40}, i.e. 119.
2 will be replaced by {7 + 11 + 15 + 29 + 35 + 40}, i.e. 137.
29 will be replaced by {35 + 40}, i.e. 75.
1 will be replaced by {2 + 7 + 11 + 15 + 29 + 35 + 40}, i.e. 139.
7 will be replaced by {11 + 15 + 29 + 35 + 40}, i.e. 130.
15 will be replaced by {15 + 29 + 35 + 40}, i.e. 104.
40 will be replaced by 0 {as there is no node with a value greater than 40}.
35 will be replaced by {40}, i.e. 40.
```

Problem approach

**Step 1:** I made a helper function where I passed the root node and 0, which worked as the sum in it.

**Step 2:** Made a base case: if the root is null, return.

**Step 3:** Went to the rightmost node of the tree, as the rightmost node is the only node that will have the highest value in the whole BST.

**Step 4:** Added the root's data to the sum variable, which was passed into the helper function.

**Step 5:** After adding the root's value to the sum variable, updated the current root's data with that sum.

**Step 6:** Called recursively on the left side of the tree by sending root. Left as the root node and the updated sum to the helper function.

```
If any character is a ‘?’ we can replace that character with any other character.
If a character is a * we can replace * with any sequence of characters including the empty sequence.
```

```
Let str = “abc?" and pat= “abcd”
We return true as ‘?’ can be replaced with ‘d’ and this makes ‘str’ and ‘pat’ same.
```

03

Round

Medium

Face to Face

Duration25 minutes

Interview date4 Dec 2022

Coding problem2

Problem approach

Create a frequency array, freq, to count the number of occurrences of each task. Sort the freq array in ascending order. Calculate the maximum frequency, maxFreq, of any task. Calculate the number of idle slots, idleSlots, required by the most frequent task, which is equal to (maxFreq - 1) * n. Iterate over the remaining tasks in descending order of frequency and subtract the minimum of maxFreq and the frequency of the task from idleSlots. If idleSlots is still positive, add it to the length of the input task list, tasks. Otherwise, return tasks.size().

```
1. Horizontally as 1x2 tile
2. Vertically as 2x1 tile
```

```
The number of ways might be large so output your answer modulo 10^9 + 7.
```

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

How do you write a single-line comment in C++?

Choose another skill to practice

Start a Discussion

Similar interview experiences

SDE - Intern

3 rounds | 3 problems

Interviewed by Infineon Technologies

1318 views

0 comments

0 upvotes

Business Technology Analyst

4 rounds | 5 problems

Interviewed by Squadstack

2366 views

0 comments

0 upvotes

Software Engineer

3 rounds | 5 problems

Interviewed by Infineon Technologies

1235 views

0 comments

0 upvotes

Product Engineer

3 rounds | 5 problems

Interviewed by Squadstack

1489 views

0 comments

0 upvotes

Companies with similar interview experiences

Software Developer

5 rounds | 14 problems

Interviewed by Microsoft

3052 views

1 comments

0 upvotes

Software Developer

6 rounds | 12 problems

Interviewed by SAP Labs

1786 views

0 comments

0 upvotes

Software Developer

3 rounds | 3 problems

Interviewed by Mindtree

1210 views

0 comments

0 upvotes