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

Specialist Programmer

Infosys private limited
upvote
share-icon
2 rounds | 8 Coding problems

Interview preparation journey

expand-icon
Journey
Belonging to tier 3 college is itself a motivation to work, was in my 2nd year, I realised that I have to do anything part from course curriculum to get ahead, so I started exploring web dev and DSA, and did DSA straight for 200 days.
Application story
I applied thorugh hackwithINFY, and after 1 month I got the test link, I got 3 question in online coding round, one was from string which is very easy,one is from DP on graph, (twisted airport question from leetcode) and last one is extremely tough, it was on 3Dmatrix DP question. i only attempted 2 question out of 3 Every question is of 100 marks, I got 183/200. and after 1 month, I got a mail I have cleared the online assessment and qualified for the interview,. in interview I remember the exact question 1.was median of two streams 2. next palindrome of a number, eg, 141 -> output will be 151 edge cases were 191-> 202 and 999->1001 apart from these two coding question they based OOPS concept , deadlock from OOPS, transaction from DBMS, ACID properties from DBMS. and had just 2-3 minutes discussion on project which I mentioned in my resume. That' all after 10 months I got a mail from Infosys that I will be joining as specialist programmer from 25 July 2022 for 9.5 CTC
Why selected/rejected for the role?
I was selected because I have scored 183/300 in the online assessment, and answered all interview question during interview and also coded it in front of interviewer
Preparation
Duration: 7 months
Topics: String, Array, Trees, Graph, oops, computer network, DBMS,
Tip
Tip

Tip 1 : Remove all the noise, just study
Tip 2 : DSA is like pre exam of UPSC, if you have to clear any company, you have to do DSA, no way of skipping unless you are an extremely good developer.

Application process
Where: Other
Eligibility: 7 CGPA
Resume Tip
Resume tip

Tip 1 : Keep at least 2 project
Tip 2 : And never lie in your resume

Interview rounds

01
Round
Hard
Online Coding Test
Duration180 minutes
Interview date21 May 2021
Coding problem2

1. Counting Pairs

Moderate
35m average time
65% success
0/80
Asked in companies
UberSamsungSalesforce

You are given a positive integer N and an equation 1/X + 1/Y = 1/N

You need to determine the count of all possible positive integral solutions (X, Y) for the above equation.

Note:

1. X and Y should be greater than 0.
2. (X, Y) and (Y, X) are considered different solutions if X is not equal to Y, i.e. (X, Y) and (Y, X) will not be distinct if X=Y.
Try solving now

2. Corporate Flight Bookings

Easy
15m average time
85% success
0/40
Asked in companies
Tata Consultancy Services (TCS)Wells FargoCisco

You have been given an array/list “BOOKINGS” of booking details of ‘N’ flights from 1 to ‘N’. Each booking detail contains three positive integers [first, last, seats] which represent a booking for flights “first” through “last” (inclusive) with “seats” seats reserved for each flight in the range.

Now, you are supposed to return an array/list “ANSWER” of length ‘N’, where answer[i] represents the total number of seats reserved for ith flight.

Try solving now
02
Round
Easy
Face to Face
Duration60 minutes
Interview date21 Jul 2022
Coding problem6

I got a mail I have cleared the online assessment and qualified for the interview,.

1. Median in a stream

Hard
50m average time
50% success
0/120
Asked in companies
PhonePeDelhiveryCognizant

Given that integers are read from a data stream. Your task is to find the median of the elements read so far.

Median is the middle value in an ordered integer list. If the size of the list is even there is no middle value. So the median is the floor of the average of the two middle values.

For example :
[2,3,4] - median is 3.
[2,3] - median is floor((2+3)/2) = 2.


Try solving now

2. Palindrome Pairs

Moderate
25m average time
75% success
0/80
Asked in companies
CIS - Cyber InfrastructureAmazonFacebook

You are given a list of ‘N’ words ‘WORDS’. Your task is to return all pairs of the distinct indices (i, j) in ‘WORDS’, such that the concatenation of WORDS[i] and WORDS[j] is a palindrome.

For Example:

You are given ‘WORDS’ = [“cat”, “mat”, “tac”]. Then the answer will be [(0, 2), (2, 0)}, because “cat” + “tac” = “cattac” which is a palindrome and “tac” + “cat” = “taccat” which is also a palindrome.
Problem approach

I used stringBuilder, removed the middle character, increased it by 1 and appended back

Try solving now

3. OOPS

What is deadlock in OOPS?

4. DBMS Question

What are ACID properties?

5. DBMS

What are transaction properties in sql

6. Project Questions

Explain your projects.

How long it takes to complete?

What all challenges you faced?

How your project is unique?

Here's your problem of the day

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

Skill covered: Programming

To make an AI less repetitive in a long paragraph, you should increase:

Choose another skill to practice
Similar interview experiences
Specialist Programmer
2 rounds | 4 problems
Interviewed by Infosys private limited
925 views
0 comments
0 upvotes
Specialist Programmer
2 rounds | 3 problems
Interviewed by Infosys private limited
876 views
0 comments
0 upvotes
Specialist Programmer
2 rounds | 11 problems
Interviewed by Infosys private limited
1239 views
0 comments
0 upvotes
Specialist Programmer
2 rounds | 4 problems
Interviewed by Infosys private limited
131 views
0 comments
0 upvotes