Infosys private limited interview experience Real time questions & tips from candidates to crack your interview
Digital Specialist Engineer
Infosys private limited
2 rounds | 3 Coding
problems
Selected Interview preparation journey
Journey
My journey towards becoming a Digital Specialist Engineer at Infosys started when I participated in HackWithInfy, the coding competition organized by Infosys. I was in my final year of B.Tech when I applied for the competition, and I was excited to test my coding skills against other participants.
The first coding round in HackWithInfy involved solving three questions related to the concepts of tree and graphs. I managed to solve two out of the three questions, which boosted my confidence and motivated me to continue.
After a few weeks, I received an interview call from Infosys for the Digital Specialist Engineer role. During the interview, I was asked about my coding experience, projects, and problem-solving skills. The interviewers also asked me to solve a few technical questions related to programming and database concepts.
I was delighted when I received an offer from Infosys for the DSE role with a package of 6.25 LPA. The offer was a validation of my hard work and dedication towards coding, and it felt like a dream come true.
Overall, participating in HackWithInfy and going through the interview process with Infosys was a challenging but rewarding experience. I learned a lot about problem-solving, coding, and technical interviews, which will help me in my future career.
Application story
I was in my final year of B.Tech when I applied for HackWithInfy, the coding competition organized by Infosys. As a computer science student, I was always interested in coding and problem-solving, and I saw HackWithInfy as a great opportunity to test my skills and compete against other students from across the country.
The first round of the competition involved solving three coding problems related to tree and graph data structures. I spent a lot of time practicing these concepts, working through similar problems, and learning from my mistakes. When the day of the competition arrived, I was excited but also a bit nervous. However, I managed to solve two of the three problems, which was a huge confidence booster for me.
A few weeks later, I received an interview call from Infosys for the Digital Specialist Engineer role. I was thrilled at the opportunity, but I knew that the interview process would be challenging. I spent the next few days preparing for the technical interview, focusing on the fundamentals of data structures, algorithms, and programming languages. I practiced coding problems on online platforms like LeetCode and HackerRank, and I reviewed my college textbooks and notes to refresh my memory on key concepts.
During the interview, the panel asked me a variety of technical questions related to programming, database concepts, and system design. I was also asked to solve coding problems on the whiteboard, which was a bit nerve-wracking, but I managed to stay calm and focused. Overall, I felt like I did well in the interview, but I wasn't sure if I had done enough to get the job.
A few days later, I received the good news that I had been selected for the Digital Specialist Engineer role at Infosys, with a package of 6.25 LPA. I was thrilled and relieved at the same time, as I knew that the competition for this role was tough. Looking back, I realized that participating in HackWithInfy and preparing for the interview process helped me not only land the job but also improve my problem-solving and technical skills. I'm excited to start my career at Infosys and continue learning and growing as a software engineer
Why selected/rejected for the role?
i got selected for this role, be focused on the basic concept of software engineering they will help you in your interview round
Preparation
Duration: 5 months
Topics: Data Structures, Object Oriented Programming, Database management system, SDLC and Operating Systems
Tip 1 : Practice with coding problems: One of the best ways to prepare for technical interviews is to practice solving coding problems. There are many online resources, such as HackerRank, LeetCode, and CodeSignal, that provide a variety of coding challenges that can help you improve your problem-solving skills.
Tip 2 : Focus on fundamentals: While it's important to practice coding problems, it's equally important to have a strong understanding of the fundamentals. Make sure you have a good grasp of key concepts like data structures, algorithms, and programming languages. Spend time reviewing basic concepts and try to understand how they can be applied to solve different problems. You can also review your college textbooks, online courses, or attend workshops to brush up on fundamentals.
Application process
Where: Campus
Eligibility: 7 CGPA
Tip 1 : Highlight your relevant experience and achievements: Your interview experience is a great opportunity to showcase your skills and achievements. Make sure to highlight your experience in coding, problem-solving, and software development in your resume. You can also include any relevant projects, internships, or certifications that demonstrate your technical expertise. Use metrics and specific examples to show the impact of your work and achievements.
Tip 2 : Keep it concise and well-organized: A good resume should be brief, well-organized, and easy to read. Use bullet points and clear headings to break up sections and make your resume more scannable. Avoid using long paragraphs or dense blocks of text, as this can make your resume hard to read. Also, make sure to use a clear and professional font, and keep the formatting consistent throughout your resume.
Interview rounds
01
Round
Hard
Online Coding Test
Duration180 mintues
Interview date30 Mar 2021
Coding problem1
1. Minimum Dishes to Cook
Moderate
0/80
Asked in company
The chef has received the order to make ‘N’ dishes represented by an array ‘Arr’, where ‘Arr[i]’ denotes the type of dish.
Chef has the liberty to cancel at most ‘M’ orders. He cancels the order in such a way that the different types of dishes he has to cook are minimized. The chef is lazy and dumb so he has asked you to help him.
Find the count of the minimum variety of dishes that the chef will have to cook.
For Example :
If N = 6, Arr = { 1, 2, 3, 1, 1, 2 } and M = 2
Then the chef will have to cook at least 2 different varieties of dishes, because:
He may cancel the orders for both the dishes of type 2, now he left with {1, 1, 1, 3}
He may cancel the orders for dish type 3 and one of the orders of dish type 1, now he left with {2, 1, 1, 2}
There are many other ways to cancel the orders, but none of them will result in an answer less than 2, hence we will return the value 2.
Problem approach
The problem statement is about Ramu who has N dishes of different types arranged in a row. Each dish is denoted by a number Ai, where i is the index of the dish in the row, and Ai is the type of the dish. Ramu wants to choose as many dishes as possible from the given list, but he has two conditions to satisfy:
1.He can only choose dishes of the same type.
2.No two chosen dishes should be adjacent to each other.
The objective is to find which type of dish Ramu should choose from so that he can pick the maximum number of dishes.
To solve this problem, we can use dynamic programming. We define an array dp of size N, where dp[i] represents the maximum number of dishes that can be chosen up to the ith index, given that we have chosen the ith dish. We can then use the following recurrence relation to compute the value of dp[i]:
dp[i] = max(dp[j]) + 1, where j is the index such that A[i] = A[j] and j is at least two positions to the left of i.
This means that we choose the ith dish, and then look for the last dish of the same type that was chosen at least two positions to the left of i. We add 1 to the maximum number of dishes that can be chosen up to that dish and store the result in dp[i].
The final answer is then the maximum value in the dp array. This tells us the maximum number of dishes that can be chosen while satisfying the given conditions, and also tells us which type of dish to choose.
02
Round
Easy
Video Call
Duration60 minutes
Interview date11 Jun 2022
Coding problem2
1. Swap And Maximise
Easy
10m average time
90% success
0/40
Asked in companies
You are given a circular array consisting of N integers. You have to find the maximum sum of the absolute difference between adjacent elements with rearrangement of array element allowed i.e after rearrangement of element find the maximum value of |a1 – a2| + |a2 – a3| + …… + |an – 1– an| + |an – a1|, where a1, a2, a3… an are the elements of the array.
An array is a circular array when after the last element 'an', 'a1' appears in the array.
2. Basic HR Questions
Tell me something about yourself.
Asked me to explain my recent project.
My project was based on React.js
What are the modules you have implemented?
How this project, can be extended to the next level?
Which database have you used?
Future work of this project?
Which programming are you comfortable with? I told her to go with C++.
What are the datatypes are there in C++?
Which access modifier is used in the Structs?
How is Structs is different from Classes?
What is Polymorphism and also explain its types?
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
Digital Specialist Engineer
3 rounds | 3 problems
Interviewed by Infosys private limited
Selected 
1042 views
0 comments
0 upvotes
Digital Specialist Engineer
2 rounds | 3 problems
Interviewed by Infosys private limited
Selected 817 views
0 comments
0 upvotes
Digital Specialist Engineer
2 rounds | 4 problems
Interviewed by Infosys private limited
Selected 1124 views
0 comments
0 upvotes
Digital Specialist Engineer
3 rounds | 4 problems
Interviewed by Infosys private limited
Selected 876 views
0 comments
0 upvotes