New update is available. Click here to update.

Software Engineer

Infineon Technologies

3 rounds | 5 Coding
problems

308 views

0 comments

0 upvotes

Interview preparation journey

Preparation

Duration: 3 Months

Topics: Data Structures, Algorithms , OOPS, Dynamic Programming , DBMS , CN , OS , Graphs

Tip

Tip 1 : Practice Atleast 250 good Questions covering various topics/

Tip 2 : Do atleast 2 projects

Tip 3 : Work on your communication skill as well

Application process

Where: Campus

Eligibility: 7+ CGPA with no backlog

Resume tip

Tip 1 : Try to limit your resume to a one-pager.

Tip 2 : Do not put fake on resume.

Interview rounds

01

Round

Hard

Online Coding Interview

Duration60 Minutes

Interview date25 Sep 2020

Problems2

Longest Substring Without Repeating Characters

`Suppose given input is ...`

view more

Problem approach

The basic idea is, keep a hashmap which stores the characters in string as keys and their positions as values, and keep two pointers which define the max substring. move the right pointer to scan through the string , and meanwhile update the hashmap. If the character is already in the hashmap, then move the left pointer to the right of the same character last found. Note that the two pointers c...

view more

Add Two Numbers As Linked Lists ll

view more

Problem approach

public ListNode addTwoNumbers(ListNode l1, ListNode l2) {

ListNode prev = new ListNode(0);

ListNode head = prev;

int carry = 0;

while (l1 != null || l2 != null || carry != 0) {

ListNode cur = new ListNode(0);

int sum = ((l2 == null) ? 0 : l2.val) + ((l1 == null) ? 0 : l1.val) + carry;

cur.val = sum % 10;

carry = sum / 10;

prev.next = cur;

prev = cur;

l1 = (l...

view more

02

Round

Easy

Video Call

Duration45 Minutes

Interview date28 Sep 2020

Problems2

Find All Triplets With Zero Sum

view more

Problem approach

The idea is to sort an input array and then run through all indices of a possible first element of a triplet. For each possible first element we make a standard bi-directional 2Sum sweep of the remaining part of the array. Also we want to skip equal elements to avoid duplicates in the answer without making a set or smth like that.

public List> threeSum(int[] num) {

Arrays.sort(num)...

view more

Reverse Nodes in k-Group

view more

Problem approach

public ListNode reverseKGroup(ListNode head, int k) {

ListNode curr = head;

int count = 0;

while (curr != null && count != k) { // find the k+1 node

curr = curr.next;

count++;

}

if (count == k) { // if k+1 node is found

curr = reverseKGroup(curr, k); // reverse list with k+1 node as head

// head - head-pointer to direct part,

// curr - head-pointer to...

view more

03

Round

Easy

Video Call

Duration30 Minutes

Interview date28 Sep 2020

Problems1

Minimum operation needed to convert to the given string

view more

Problem approach

public int minDistance(String word1, String word2) {

int m = word1.length();

int n = word2.length();

int[][] cost = new int[m + 1][n + 1];

for(int i = 0; i <= m; i++)

cost[i][0] = i;

for(int i = 1; i <= n; i++)

cost[0][i] = i;

for(int i = 0; i < m; i++) {

for(int j = 0; j < n; j++) {

if(word1.charAt(i) == word2.charAt(j))

cost[i + 1][j + 1] =...

view more

Start a Discussion

Similar interview experiences

SDE - Intern

3 rounds | 3 problems

Interviewed by Infineon Technologies

479 views

0 comments

0 upvotes

SDE - Intern

2 rounds | 4 problems

Interviewed by Samsung

1731 views

0 comments

0 upvotes

SDE - 1

3 rounds | 9 problems

Interviewed by Samsung

25 views

0 comments

0 upvotes

SDE - Intern

3 rounds | 5 problems

Interviewed by Samsung

13 views

0 comments

0 upvotes

Companies with similar interview experiencs

Software Engineer

3 rounds | 3 problems

Interviewed by Mindtree

5478 views

4 comments

0 upvotes

Software Engineer

3 rounds | 7 problems

Interviewed by Optum

3574 views

0 comments

0 upvotes

Software Engineer

4 rounds | 6 problems

Interviewed by Providence Global Center LLP

3995 views

0 comments

0 upvotes

Popular Interview Experiences: