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

SDE - 1

Infosys
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
My Infosys System Engineer interview was scheduled for May 16, 2023. I received this opportunity through the InfyTQ certification exam. After taking the exam, it took almost 3 to 4 months for my interview to be scheduled, so be patient in this process as well.
Application story
My Infosys System Engineer interview was scheduled for May 16, 2023. I received this opportunity through the InfyTQ certification exam. After completing the exam, it took almost 3 to 4 months for my interview to be scheduled, so it's important to be patient during this process. My interview was conducted on the Microsoft Teams platform, where I was asked to join via a meeting link sent to my Gmail. The interview started quite late compared to the scheduled time. This might happen to you as well, so be patient and stay in the meeting. If for some reason you are unable to attend the interview, it may not be rescheduled. The interview lasted about 15 minutes, and I found it to be fairly easy. The interviewer then began the interview.
Why selected/rejected for the role?
I did not receive the offer because I didn't clear the technical round. I suggest preparing thoroughly on the topics you mentioned in your resume.
Preparation
Duration: 3 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip
Tip

Tip 1 - Practice at least 350 Questions.
Tip 2 - Do at least 3 projects.

Application process
Where: Campus
Eligibility: 7
Resume Tip
Resume tip

Tip 1: be confident.
Tip 2: have some projects on resume.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration180 mins
Interview date16 May 2023
Coding problem2

1. Subarray With Given Sum

Moderate
15m average time
85% success
0/80
Asked in companies
CognizantInfo Edge India (Naukri.com)Gartner

Given an array ARR of N integers and an integer S. The task is to find whether there exists a subarray(positive length) of the given array such that the sum of elements of the subarray equals to S or not. If any subarray is found, return the start and end index (0 based index) of the subarray. Otherwise, consider both the START and END indexes as -1.

Note:

If two or more such subarrays exist, return any subarray.

For Example: If the given array is [1,2,3,4] and the value of S is equal to 7. Then there are two possible subarrays having sums equal to S are [1,2,3] and [3,4].

Problem approach

Given an unsorted array `A` of size `N` that contains only positive integers, find a continuous sub-array that sums to a given number `S` and return the left and right indices (1-based indexing) of that subarray.

Try solving now

2. Min Jumps

Easy
15m average time
85% success
0/40
Asked in companies
IntuitSwiggyAdobe

You live in a Ninja town which is in the form of a N * M grid. In this town, people travel from one place to another by jumping over the buildings which are present in each cell of the grid. It is Christmas eve, and Santa wants to give gifts and chocolates to the kids who live in the building which is present at the cell (N - 1, M - 1). Initially, Santa is present on cell (0, 0). Since Santa is in a hurry, help him find a path from starting point to the endpoint with the least amount of time.

The Santa may go only from one building to any of its adjacent buildings which is present either to the right or to the bottom or bottom right cell i.e. if the current position is (x, y), he may go to (x + 1, y + 1) or (x + 1, y) or (x, y + 1) given that the new coordinates are in the grid. The time taken to reach from one building to another is equal to the absolute difference between the heights of buildings.

Note:

1. The heights of the buildings are positive.
2. Santa starts from the cell (0, 0) and he has to reach the building (N - 1, M - 1).
3. Santa cannot leave the grid at any point of time.
Problem approach

Given an array of N integers `arr[]`, where each element represents the maximum length of the jump that can be made forward from that position. This means if `arr[i] = x`, then we can jump any distance `y` such that `y ≤ x`. Find the minimum number of jumps required to reach the end of the array (starting from the first element). If an element is 0, then you cannot jump over that element.

Try solving now
02
Round
Medium
Face to Face
Duration60 mins
Interview date18 May 2023
Coding problem2

1. Leaders in an array

Easy
15m average time
90% success
0/40
Asked in companies
AdobeMicrosoftGenpact

Given a sequence of numbers. Find all leaders in sequence. An element is a leader if it is strictly greater than all the elements on its right side.

Note:
1. Rightmost element is always a leader.

2. The order of elements in the return sequence must be the same as the given sequence
Example:
The given sequence is 13, 14, 3, 8, 2 .

13 Not a leader because on the right side 14 is greater than 13.

14 lt is a leader because no one greater element in the right side.

3 Not a leader because on the right side 8 are greater than 3.

8 It is a leader because no one greater element on the right side.

2 It is a leader because it is the rightmost element in a sequence.

Hence there are 3 leaders in the above sequence which are 14, 8, 2.
Problem approach

Given an array A of positive integers, your task is to find the leaders in the array. An element of the array is a leader if it is greater than or equal to all the elements to its right side. The rightmost element is always a leader.

Try solving now

2. Kth smallest element

Easy
15m average time
85% success
0/40
Asked in companies
SnapdealMicrosoftMedia.net

You are given an array of integers 'ARR' of size 'N' and another integer 'K'.


Your task is to find and return 'K'th smallest value present in the array.


Note: All the elements in the array are distinct.


Example
If 'N' is 5 and 'K' is 3 and the array is 7, 2, 6, 1, 9

Sorting the array we get 1, 2, 6, 7, 9

Hence the 3rd smallest number is 6.
Problem approach

Given an array `arr[]` and an integer `K`, where `K` is smaller than the size of the array, the task is to find the Kth smallest element in the array. It is guaranteed that all array elements are distinct.

Try solving now
0
Round
Easy
HR Round
Duration30 minutes
Interview date3 Jul 2023
Coding problem1

Managerial round.

1. Basic HR Questions

1. Where do you see yourself in 5 years?

2. What are your strengths and weakness?

Here's your problem of the day

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

Skill covered: Programming

How many times will the loop execute? for(int i = 0; i < 5; i++)

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
2 rounds | 2 problems
Interviewed by Infosys
1705 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Infosys
0 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Infosys
1027 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 3 problems
Interviewed by Infosys
966 views
1 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
1 rounds | 2 problems
Interviewed by Tata Consultancy Services (TCS)
0 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 4 problems
Interviewed by Tata Consultancy Services (TCS)
6250 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 3 problems
Interviewed by BNY Mellon
5498 views
3 comments
0 upvotes