Infosys private limited interview experience Real time questions & tips from candidates to crack your interview
Power Programmer
Infosys private limited
3 rounds | 5 Coding
problems
Selected Interview preparation journey
Journey
I got the opportunity to appear in the interview for the role of Power Programmer at Infosys in my 3rd year of college. It was through InfyTQ and HackwithInfy. I cleared InfyTQ which had 2 coding and 20 objective questions. In HackwithInfy I could attempt 2.22 / 3 questions which bagged me an interview call. After a month interviews happened and I got selected for the role.
Application story
I applied through the InfyTQ program which is hosted by Infosys every year. I cleared that and appeared for HackwithInfy and cleared 2.22/3 coding questions. It was off campus but later during onboarding, they do verify details through placement departments of the college
Why selected/rejected for the role?
I was selected as I was confident enough to code and answer the questions. I had good preparation of core subjects and projects. I have good communication skills which helped me establish a good impression on the interviewer.
Also, in case I did not have the answer, I did not beat around the bush and waste his time, simply told him I had no knowledge of the question. They like honesty as nobody knows all the answers. Do not guess and utter wrong irrelevant things, cross-questioning will happen and you will lose confidence.
Preparation
Duration: 2 months
Topics: DSA, DBMS, OOPS, Python, Computer Networks, OS, Projects on Web Development
Tip 1 : Always google or research the previously asked questions and try to practice on leetcode or hackerrank
Tip 2 : Thoroughly prepare the core subjects and your project
Tip 3 : Be confident and polish your communication skills
Application process
Where: Company Website
Eligibility: Just Btech is fine
Tip 1: Have in-depth knowledge of everything you put on resume as they make questions from it.
Tip 2: Have good projects and try not to falsify anything. They are experienced people and will catch you so don't risk the opportunity.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration180 mins
Interview date23 Feb 2022
Coding problem1
There are 20 Mcq and 2 coding questions. There were fixed timing slots for every one. I had mine in the afternoon.
There was no negative marking in MCQ
1. Valid Parentheses
Easy
10m average time
80% success
0/40
Asked in companies
You're given a string 'S' consisting of "{", "}", "(", ")", "[" and "]" .
Return true if the given string 'S' is balanced, else return false.
For example:
'S' = "{}()".
There is always an opening brace before a closing brace i.e. '{' before '}', '(' before ').
So the 'S' is Balanced.
Problem approach
Step 1 - To beginners it would appear a difficult problem and they would try dictionary or double for loops and pointers. It would not satisfy all test cases and will be difficult to code.
Step 2 - Stack data structure had to be used.
Solution in python:
class Solution:
def isValid(self, s: str) -> bool:
stack = [-1]
for i in s:
if i=="(":
stack.append(")")
elif i=="{" :
stack.append("}")
elif i=="[":
stack.append("]")
else:
if stack[-1]==i:
stack.pop()
else:
stack[0] = 0
break
if len(stack)==1 and stack[0]==-1:
return True
return False
02
Round
Hard
Online Coding Test
Duration180 mins
Interview date6 Mar 2022
Coding problem3
It had 3 coding questions of hard level.
One from greedy.
One from DP
One from data structures.
On clearing 1+ problems, you can get a call for DSE role interview (6.25 LPA)
On clearing 2+ problems, you can get a call for PP role interview. (9.5 LPA)
I cleared 2.22 and got PP role interview opportunity.
Also, top 100 from this contest are invited to Infosys Pune DC for a final contest wherein they are divided in teams and given some tasks. It is of 3 days. Participants and winners get luxurious treatment, exciting goodies and a fun learning experience.
1. Best Time to Buy and Sell Stock II
Moderate
22m average time
0/80
Asked in companies
You have been given stock values/prices for N number of days. Every i-th day signifies the price of a stock on that day. Your task is to find the maximum profit which you can make by buying and selling the stocks.
Note :
You may make as many transactions as you want but can not have more than one transaction at a time i.e, if you have the stock, you need to sell it first, and then only you can buy it again.
Problem approach
class Solution:
def maxProfit(self, prices: List[int]) -> int:
self.p=prices
pft=0
for i in range(1,len(prices)):
if self.p[i]>self.p[i-1]:
pft += (self.p[i]-self.p[i-1])
return pft
2. Longest Palindromic Substring
Moderate
20m average time
80% success
0/80
Asked in companies
You are given a string ('STR') of length 'N'. Find the longest palindromic substring. If there is more than one palindromic substring with the maximum length, return the one with the smaller start index.
Note:
A substring is a contiguous segment of a string.
For example : The longest palindromic substring of "ababc" is "aba", since "aba" is a palindrome and it is the longest substring of length 3 which is a palindrome, there is another palindromic substring of length 3 is "bab" since "aba" starting index is less than "bab", so "aba" is the answer.
Problem approach
class Solution:
def longestPalindrome(self, s: str) -> int:
h={}
for i in s:
if i not in h:
h[i]=1
else:
h[i]+=1
tl=0
one = 0
for i in h:
if h[i]==1:
one=1
elif h[i]%2==0:
tl= tl + (h[i])
else:
tl = tl + (h[i]-1)
one=1
return tl + one
3. Maximum Depth Of A Binary Tree
Easy
15m average time
85% success
0/40
Asked in companies
You are given the root node of a binary tree with N nodes, whose nodes have integer values. Your task is to find the maximum depth of the given Binary tree.
Depth of a binary tree is the same as its height. In simpler terms, you have to find the total number of nodes encountered while moving from the root node to the farthest leaf node, along the longest path of the binary tree.
Example:-
If we are given the above binary tree as input then moving from root node(5) to the farthest leaf node(50), the path formed will be [ 5->10->25->35->40->45->50 ]. The total number of nodes encountered is 7, therefore the maximum depth of the binary tree is 7.
Problem approach
Could not solve fully as I cleared 2.22/3 questions only.
03
Round
Medium
Video Call
Duration55 mins
Interview date28 Apr 2022
Coding problem1
My HackwithInfy (Advantage Round) was held on 8th March 2022. I managed to solve 2.22/3 questions. On 12th April 2022 results came out and I had to interview for the role of Power Programmer.
The mail for the interview came on the evening of 28th April 2022. (Just 1.5 days to prepare). The interview was on 30th April 2022 at 10:00 am.
Mode of Interview: Online Video Chat (Video and Audio both switched on the whole time)
Platform: Microsoft Teams
Duration: 50 minutes
Before the actual Q/A started, he completed the formalities of checking my identification proof and capturing my face.
Then, he asked me to introduce myself.
In the introduction, one can tell briefly about themselves (schooling, family, etc.), projects, skills, and ambitions.
Then he started with the questions. He asked me how good I was at problem-solving, to which I responded that I had a gold badge on Hackerrank in the same. So he gave me a question to code and told me to share my screen. He said I could use any text editor to write the code for that problem-solving question.
I took 15 min and coded the whole solution in python. He asked me to explain each line of the code. He gave me 3 test cases to run. All my test cases gave the correct output. He was impressed and even commented “Perfect”. Later, he wanted me to explain the space and time complexity which I did nicely. He asked me about the space optimization of my code – which I could not answer. (But he was cool on it and was satisfied as my code ran correctly)
Hint: This coding question is exactly similar to the question named Candies on HackerRank.
After this, he asked me to rate myself in subjects like DBMS, DSA, Computer Networks, Python (as this is my preferred language), and OOPS. Then he asked me questions related to these.
Listed below are the questions that he asked me :
DBMS – ACID properties, rollback, and its real-time experience.
OOPS- explain oops to me considering I am a 6-year child, Features of OOPS
OS – semaphores, deadlock, and its condition
DSA-Segment Trees, Stack and heap memory difference
Python – Advantages and Disadvantages, Why Python, Memory Management in Python
Out of all these, I could not answer the 4th point. Rest everything I explained nicely and was able to impress him.
After this, he just asked 2-3 HR questions like strengths, goals, and weaknesses. He then ended the meeting by saying that he’ll share my feedback further and was hoping that I clear the interview.
TIPS:
Prepare projects well. In my case, nothing was asked about projects, but a few of my friends had questions about projects.
Prepare your resume well.
Prepare the core subjects (at least the main topics and their applications)
If you don’t know an answer simply say that I cannot recall or I have no idea about this. They don’t someone perfect but someone who has a learning attitude. So be optimistic and generate a positive vibe.
Hands-on coding is a must as you can’t run away from the fact that you will have to code a question live over there on your own.
Abstain from any malicious work including googling, cheating, or having friends/seniors in your room during the interview. The other person is a senior and has been where you are. Try to avoid any of such things else it will lead to banning and rejection from the company.
In case of any queries/answers feel free to ask in the comments.
RESULT: I got placement offer for the role of Power Programmer. 42 students from my college had interviewed and only 7 got this offer. So grateful to be a part of those 7.
P.S: The students who interviewed for SP role and did not clear it, got DSE role
1. Ninja And Candies
Moderate
15m average time
85% success
0/80
Asked in companies
Ninja is a boy who lives in ninjaland. Every day, during the morning he gets 1 coin from his mother. He wants to buy exactly ‘N’ candies. Each of the candies cost 2 coins usually and 1 coin if it is on sale. Ninja has to buy exactly K[i] candies of the i-th type(he buys candies in the evening).
Ninjas can buy any(possibly zero) number of candies of any type during any day(if he has enough money to do it). If the candy is on sale he can buy it for 1 coin and otherwise he has to buy it for 2 coins.
There are ‘M’ special offers in the candy shop. The j-th offer (D[j], C[j]) means that candies of the C[j]-th type are on sale during the D[j]-th day.
Ninja wants to buy all candies as soon as possible. Your task is to calculate the minimum day when he can buy all the candies.
Problem approach
It is a greedy concept question where you compare adjacent values simultaneously in 1 loop to get maximum answer.
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
Power Programmer
1 rounds | 3 problems
Interviewed by Infosys private limited
Rejected
1162 views
1 comments
0 upvotes
Power Programmer
2 rounds | 2 problems
Interviewed by Infosys private limited
Selected 3421 views
1 comments
0 upvotes
Power Programmer
2 rounds | 4 problems
Interviewed by Infosys private limited
Selected 0 views
0 comments
0 upvotes
Power Programmer
1 rounds | 1 problems
Interviewed by Infosys private limited
Selected 559 views
0 comments
0 upvotes