Infosys private limited interview experience Real time questions & tips from candidates to crack your interview

Software Engineer

Infosys private limited

3 rounds | 4 Coding problems

Anonymous

Fresher | Jun 2021

Selected

Interview preparation journey

Preparation

Duration: 9 months

Topics: Data structures and Algorithms, Operating System, DBMS, OOPS, Computer Network, Web Development

Tip

Tip 1 : Be very clear with your project explanation.
Tip 2 : Practice at least 500 dsa problem
Tip 3 : Also try to cover all the cs core subjects explanation clearly.

Application process

Where: Other

Eligibility: 6.5 cgpa

Resume tip

Tip 1 : Make it clean with appropriate knowledge.
Tip 2 : Provide true information .

Interview rounds

Round

Medium

Video Call

Duration45 minutes

Interview date15 Jun 2021

Coding problem1

It was morning time and from 10:00 am . It happened via the google meet online process and it was very smooth onboarding . Interviewer was very friendly kind of nature . I completed the question with optimised approach.

1. Maximize the sum

Moderate

15m average time

85% success

0/80

Asked in companies

You are given two sorted arrays of distinct integers, ‘ARR1’ and ‘ARR2’. If you find a common element in both arrays, you can switch from one array to another.

Your task is to find a path through the intersections i.e common integers of ‘ARR1’ and ‘ARR2’, that produces maximum sum and return that maximum sum as the answer.

For example:

Let ‘ARR1’ = [1, 5, 10, 15, 20]  and ‘ARR2’ = [2, 4, 5, 9, 15]
In this example, common points are 5, 15.

First, we start with ARR2 and take the sum till 5 (i.e. sum = 11). Then we will switch to ‘ARR1’ at element 10 and take the sum till 15. So sum = 36. Now no element is left in ‘ARR2’ after 15, so we will continue in array 1. Hence sum is 56. And the path is 2 -> 4 -> 5 -> 10 -> 15 -> 20.

Try solving now

Round

Medium

Video Call

Duration40 minutes

Interview date15 Jun 2021

Coding problem1

It was afternoon session and the interviewer was very supportive in nature and gave me the hint too to think the approach and finally i came up the solution which he was expecting.

1. Zigzag Binary Tree Traversal

Easy

10m average time

90% success

0/40

Asked in companies

You are given a ‘Binary Tree’.

Return the level-order traversal of the Binary Tree.

Example:

Input: Consider the following Binary Tree:

Output: 
Following is the level-order traversal of the given Binary Tree: [1, 2, 3, 5, 6, 4]

Problem approach

PROGRAM:

vector zigZagTraversal(Node* root)
{
// Code here
vectorv;
queueq;
if(root==NULL)
return v;
q.push(root);
int c=0;
while(!q.empty())
{
int s=q.size();
vectorv2;
Node*front;
for(int i=0;idata);
if(front->left!=NULL)
q.push(front->left);
if(front->right!=NULL)
q.push(front->right);

}
c++;
if(c%2==0)
reverse(v2.begin(),v2.end());
v.insert(v.end(), v2.begin(), v2.end());
}

return v;
}

Try solving now

Round

Easy

Video Call

Duration20 minutes

Interview date15 Jun 2021

Coding problem2

It was late evening and happened in a very smooth way.

1. Operating System Question

What is a Scheduling Algorithm?

Problem approach

Tip 1:Try to explain via the real life example.
Ans:
A scheduling algorithm is a process that is used to improve efficiency by utilizing maximum CPU and providing minimum waiting time to tasks. It simply deals with the problem of deciding which of outstanding requests is to be allocated resources. Its main aim is to reduce resource starvation and to ensure fairness amongst parties that are utilizing the resources. In simple words, it is used to allocate resources among various competing tasks.

2. Operating System Question

What is the difference between paging and segmentation?

Problem approach

Paging: It is generally a memory management technique that allows OS to retrieve processes from secondary storage into main memory. It is a non-contiguous allocation technique that divides each process in the form of pages.
Segmentation: It is generally a memory management technique that divides processes into modules and parts of different sizes. These parts and modules are known as segments that can be allocated to process.