Infosys Interview Experience | Java Backend | Bangalore | Oct 25
Java BackendSpecialist Programmer Interview Experience (Sep 2025)
Specialist ProgrammerInfosys Interview Experience | Associate Consultant (Pune) | 2.5+ Years Experience
Associate ConsultantInfosys SP/DSE || OA Problems || July 2025 ✅
SP/DSEMy Infosys Specialist Programmer Interview Experience – March 2025
specialist programmer6 more experiences below
Summary
I recently interviewed at Infosys for a Java Backend role in Bangalore. The interview process consisted of three rounds: a technical round, a hiring manager round, and an HR round. I successfully cleared the technical and hiring manager rounds and am currently awaiting background verification.
Full Experience
I secured an interview opportunity at Infosys by directly applying on their portal for a Java Backend position. I have 3 years of experience.
1st Round - Technical Round (30 mins)
The interviewer covered a wide range of topics, from API creation to core Java concepts. We discussed the difference between throw and throws, interface and abstraction, checked and unchecked exceptions, and polymorphism. I was also asked a question to reverse a string. I successfully cleared this round.
2nd Round - Hiring Manager (30 mins)
This round involved one output-based question. The manager also asked questions based on my resume and SQL. I was selected to move to the next round.
3rd Round - HR Round (15 mins)
In the final round, the HR representative discussed salary expectations, my notice period, and other relevant details.
Currently, my status is undergoing background verification.
Interview Questions (5)
Explain the key differences between the throw keyword and the throws keyword in Java, including their usage and purpose.
Discuss the differences between interfaces and abstract classes in Java, their use cases, and when to choose one over the other.
Explain the distinction between checked and unchecked exceptions in Java, providing examples of each and how they are handled.
Explain the concept of polymorphism in Java, including its types (compile-time and runtime) and how it is achieved with method overloading and overriding.
Given a string, write a program or explain an algorithm to reverse the string.
Summary
I successfully navigated the interview process for the Infosys Specialist Programmer role through HackWithInfy, which involved an online assessment, an offline coding round, a basic DSA/CS concepts discussion, and a final HR/technical interview. The overall experience was focused on Data Structures & Algorithms and fundamental computer science principles.
Full Experience
I wanted to share my entire journey for the Infosys Specialist Programmer role through HackWithInfy, detailing the assessment to interview process.
Registration
I registered for HackWithInfy through the placement cell at my university.
Online Assessment (OA)
The OA consisted of 3 coding questions. I was able to solve 2 questions completely and partially solve 1. A few weeks later, I received the shortlist email for the interview round.
Round 1 – Problem Solving (Offline Coding)
After about a month, the interview process began. The first round was an offline coding test conducted physically in front of interviewers. We were divided into groups of 5 and given 2 coding problems on the Wingspan portal. The requirement was to solve at least one problem completely. Common topics included Greedy, Knapsack, Dynamic Programming, Trees, Graphs, Segment Trees, and Fenwick Trees. I managed to pass 14 out of 15 test cases (3 sample + 12 hidden).
Round 2 – Basic DSA / CS Concepts
This was a short DSA round to check my basic problem-solving skills. I was asked questions on Climbing Stairs, swapping two numbers without using a third variable, and Merge Sort. I also learned that other candidates were asked variations of Fibonacci, Longest Increasing Subsequence (LIS), Longest Common Subsequence (LCS), and other standard DSA problems. Having cleared the OA, I found this round to be straightforward.
Round 3 – HR + Technical Discussion (1:1)
This was a one-on-one interview, mostly focused on my resume and fundamental concepts. The interviewer asked me to rate myself out of 5 on each skill mentioned in my resume. Then, basic questions were asked from OOPs, SQL, and HTML/CSS. This round lasted around 20 minutes and was quite relaxed.
Conclusion
That was the end of my interview process. Overall, the experience was smooth and focused mainly on DSA + basics of CS.
Interview Questions (6)
The standard LeetCode problem asking to find the number of distinct ways to climb to the top of n stairs if you can climb either 1 or 2 steps at a time.
Swap the values of two integer variables without using a temporary third variable. This can typically be done using arithmetic operations (addition/subtraction) or bitwise XOR operations.
Explain and possibly implement the Merge Sort algorithm, a divide-and-conquer sorting algorithm. It divides an unsorted list into n sublists, each containing one element, then repeatedly merges sublists to produce new sorted sublists until there is only one sorted list remaining.
Basic questions related to Object-Oriented Programming concepts such as Encapsulation, Inheritance, Polymorphism, and Abstraction. This includes defining them and providing real-world examples.
Fundamental questions about SQL, including common commands (SELECT, INSERT, UPDATE, DELETE), different types of joins (INNER, LEFT, RIGHT, FULL), and database normalization forms.
Questions on foundational web technologies like HTML structure, common tags, CSS selectors, box model, and how to style web pages.
Preparation Tips
My preparation for the HackWithInfy and Infosys Specialist Programmer role involved a strong focus on Data Structures and Algorithms. For the coding assessments, I practiced various problem types including Greedy algorithms, Knapsack problems, Dynamic Programming, and problems related to Trees, Graphs, Segment Trees, and Fenwick Trees. For the technical discussion rounds, I ensured my understanding of basic DSA concepts was solid, and I reviewed core Computer Science fundamentals such as Object-Oriented Programming (OOPs), SQL, and HTML/CSS, which were topics I covered during my university coursework.
Summary
I recently interviewed for the Associate Consultant role at Infosys in Pune, successfully securing an offer after navigating through four comprehensive rounds that assessed my technical depth, project experience, managerial aptitude, and behavioral traits.
Full Experience
My Infosys Interview Experience for Associate Consultant
I recently had the opportunity to interview for the Associate Consultant role at Infosys in Pune, leveraging my 2.5+ years of IT experience. Here's a detailed breakdown of my interview journey across four distinct rounds:
Round 1: Technical Interview (Virtual)
This round was primarily focused on backend concepts, particularly Java, and practical implementation. The interviewer delved into several key areas:
- Java 8 Stream API: We discussed its various use cases, how to perform filtering, mapping, and grouping operations.
- Microservices & API Gateway: I was asked about common communication patterns in microservices architecture and the advantages of utilizing an API Gateway.
- Spring Boot: The discussion moved to exception handling, specifically differentiating between
@ControllerAdviceand@ExceptionHandler. - Coding Question: I was given a coding challenge to find the K-th frequent element in an array and was expected to provide an optimized solution.
Round 2: Face-to-Face (Bhubaneswar Campus)
This round was a deep dive into my projects. I had to explain in detail:
- The specific features I had delivered in my previous roles.
- My exact contribution to the team for those features.
- The business impact that my delivered features had.
Round 3: Managerial Discussion (Same Day)
The managerial round involved scenario-based and behavioral questions. A notable question was: “How would you handle a conflict within the team?” This round aimed to test my problem-solving mindset, leadership qualities, and my overall consulting approach.
Round 4: HR Discussion (After 2 Hours)
The final round was a straightforward HR discussion, covering standard topics such as:
- Salary expectations.
- Location preference (I reiterated Pune).
- Career growth opportunities and role expectations within Infosys.
Final Verdict:
I am pleased to share that I received an offer for the Associate Consultant role at Infosys in Pune!
Interview Questions (6)
I was questioned on the use cases, filtering, mapping, and grouping functionalities of the Java 8 Stream API.
The interviewer asked about communication patterns and the advantages of using Microservices and API Gateway.
I had to explain the differences and use cases between @ControllerAdvice and @ExceptionHandler in Spring Boot for exception handling.
I was given a coding question to find the K-th frequent element in an array, and an optimized solution was expected.
In the second round, I had a detailed discussion about my previous projects. I was asked to explain the features I had delivered, my exact contributions to the team, and the business impact of those features.
During the managerial round, I was presented with a scenario: 'How would you handle a conflict within the team?' This tested my problem-solving mindset, leadership qualities, and consulting approach.
Summary
I recently completed the Infosys SP-DSE Online Assessment, which featured three Data Structures and Algorithms problems covering math, greedy algorithms, combinatorics, and graph theory.
Full Experience
I recently gave the Infosys SP-DSE OA where there were three DSA problems based on math, greedy, combinatorics and graph.
Interview Questions (3)
In the enchanted forest, Pious found a straight magical vine with N glowing berries of different colors: The colours of berries are represented by lowercase letters such that Magical Vine[i] represents the colour of the berry i.
Pious wanted to gather the first few berries from the vine to craft a special bracelet for his best friend, Gala.
Gala loves symmetric patterns, so Pious wants the berries on the bracelet to follow a repeating design. A sequence of berries S is considered magical if it can be represented as:
S = P+Q+P+Q+P+...+P+Q+P
where:
-
P and Q are berry color sequences.
-
The sequence must have (2K + 1) parts, with (K + 1) copies of P and K copies of Q placed alternately.
-
Either P or Q (or both) can be empty.
Pious needs your help to figure out which initial segments of the vine form a magical pattern and how many magical segments are possible.
Find the total number of ways in which Pious can cut the first few berries from the branch such that they form a magical pattern.
Input Format
The first line contains an integer, N, denoting the number of berries on the vine.
The next line contains an integer, K, described in the problem.
The next line contains a string, Magical, Vine, denoting the colors of all the berries.
Constraints
1 <= N <= 10^6
1 <= K <= 10^6
N <= len(Magical Vine) <= N
Sample Test Cases Case 1
Input 4 1 abcd
Output 4
Explanation N=7, K=2
s = "pqpqpqp"
The magical sequence can be the first 4 berries: "papa"
We can take P = "", Q = "pq"
→ P appears 3 times (K+1), Q appears 2 times (K)
The magical sequence can be the first 5 berries: "pqpqp"
We can take P = "p", Q = "q" → P appears 3 times (K+1), Q appears 2 times (K)
The magical sequence can be the first 6 berries: "pqpqpq"
We can take P = "pq", Q = ""
→ P appears 3 times (K+1), Q appears 2 times (K)
So, 3 ways are possible.
Case 2
Input 7 2 xyzxyz
Output 1
Case 3
Input 7 2 pqpqpqp
Output 3
public class Solution {
public static int Gala_Pious(int N, int K, String Magical_Vine) {
// Write your code here
}
}
You are given an array A of length N. The value of a subsegment is calculated by multiplying all the values in that subsegment, for example the value of (2, 3, 5) is 2 * 3 * 5 = 30.
Find the total number of ways to partition the array A into consecutive subsegments that cover all elements such that the value of each subsegment is divisible by at least X factors. Since the number of ways can be large, return it modulo 10^9 + 7.
Input Format
The first line contains an integer N, denoting the number of elements in A.
The next line contains an integer X, denoting the number of factors the value of a subsegment must have.
Each of the next N subsequent lines (where 0 <= i < N) contains an integer describing A[i].
Constraints
1 <= N <= 10^5 2 <= X <= 10^5 1 <= A[i] <= 10^5
Sample Test Cases Case 1
Input 2 2 2 2
Output 2
Explanation N=2, X=2, A=[2, 2]
There are two ways to partition the array:
-
[2], [2]. Product of each = 2, which has factors {1, 2}.
-
[2, 2]. Product is 4. The number of factors of 4 is more than 2.
Case 2
Input 3 5 2 6 8
Output 1
Explanation A=[2,6,8], N=3, X=5
The only way is to take the whole array as a single subsegment.
2 * 6 * 8 = 96. Number of factors of 96 is more than 5.
Case 3
Input 5 3 2 2 3 2 2
Output 3
Explanation N=5, X=3, A=[2, 2, 3, 2, 2]
There are three ways to partition this array:
-
[2, 2, 3], [2, 2]
-
[2, 2], [3, 2, 2]
-
[2, 2, 3, 2, 2]
public class Solution {
public static int getCount(int N, int X, List<Integer> A) {
// Write your code here
}
}
The kingdom of Eldoria was a land of unity, where its N sacred cities were connected through a vast network of enchanted bridges. Each city was a stronghold of knowledge and power.
However, an ancient saga shattered the harmony of Eldoria, causing the bridges to break randomly and leaving the kingdom divided into isolated regions.
The Great Oracle of Eldoria has foreseen a way to restore balance. He must study every possible subset of cities and count the total number of ways they can be split into exactly X isolated realms, where X is a prime number.
For every prime number X from 1 to N, the Oracle must:
-
Determine the number of ways to choose a non-empty group of cities such that the bridges between them create exactly X separate connected realms.
-
Sum up all prime values of X that contribute to the valid configurations.
Find the total number of valid ways for each prime number X from 1 to N.
Input Format
The first line contains an integer N, denoting the number of cities.
Each of the next N subsequent lines (where 1 ≤ i ≤ N) contains an integer describing Cities[i].
Constraints
1 <= N <= 5000 1 <= Cities[i] < i
Sample Test Cases Case 1
Input 3 -1 1 1
Output 1
Explanation N=3, Cities=[-1,1,1] For prime X=2: result=1 For prime X=3: result=0 Only subset {2,1} forms exactly 2 connected components. Total = 1.
Case 2
Input 4 -1 1 1 1
Output 4
Explanation N=4, Cities=[-1,1,1,1] X=2, result=3 (subsets: (2,3), (2,4), (3,4)) X=3, result=1 (subset: (2,3,4)) Total=3+1=4.
Case 3
Input 4 -1 1 2 1
Output 5
Explanation N=4, Cities=[-1,1,2,1] X=2, result=5 (subsets: (1,3), (2,4), (3,4), (1,3,4), (2,3,4)) X=3, result=0 Total=5+0=5.
Summary
I had an engaging interview experience for the Specialist Programmer role at Infosys, Noida, which included two coding assessments and a detailed technical discussion covering AI, Java fundamentals, project work, and a specific coding task, leaving me with positive final thoughts.
Full Experience
Step 1: Online Coding Test – 3 Hours
My journey began with an online coding assessment featuring three DSA problems of increasing difficulty. The problems covered areas like Queue + Greedy, DP + GCD, and DP + HashMap + Prime Factorization.
Step 2: The Technical Interview – With a Live Coding Twist!
Unlike previous years, this time, the process included a live online coding assessment conducted at the Infosys Noida campus, directly in front of the interviewer. I was given 40 minutes to choose and implement one solution out of two coding problems presented (one involving DP/BFS and another on Binary Trees). Following this assessment, my interview commenced immediately.
Interview Breakdown:
- Self-Introduction & PPT Presentation: The interviewer started by asking me to introduce myself and present my prepared PowerPoint presentation.
- AI Specialization Discussion: Given my specialization, the interviewer was curious about why I chose AI, how I've utilized AI technology in my projects, and my understanding of core AI concepts with real-world applications.
- Java Deep Dive: Since Java is my primary programming language, the discussion naturally progressed to OOPs concepts with real-world examples (I used a Banking System analogy), Interfaces in Java, Call by Value/Call by Reference, Memory Management, and a specific question about why Java doesn’t support Multiple Inheritance.
- Internship & Projects Discussion: I engaged in an in-depth discussion about the projects I worked on during my internships and the technologies I used. Interestingly, for my personal projects, the interviewer was primarily interested in the problem statement and its real-world impact, rather than deep technical details.
- Coding Discussion: This part focused on my problem-solving approach. I explained my solution and its time/space complexity for the problem I solved in the pre-interview assessment. I was also asked to write a recursive Fibonacci function and analyze its time and space complexity.
- My Turn to Ask: I took the opportunity to inquire about technologies I should focus on before potentially joining, and the interviewer provided insights into current industry trends.
Overall, the interview process was structured, engaging, and highly insightful. The interviewer fostered a discussion-like atmosphere, which I appreciated. I am very grateful to Infosys for this opportunity!
Interview Questions (13)
I was asked to introduce myself and present my prepared PowerPoint presentation.
The interviewer asked why I chose AI as my specialization.
I was asked how I have used AI technology in my projects.
The discussion involved core AI concepts and their real-world applications.
Since I mentioned Java as my primary language, I was asked about OOPs concepts with real-world examples. I used a Banking System analogy for my explanation.
The interviewer asked about Interfaces in Java.
I was questioned about Call by Value and Call by Reference in Java.
The interviewer asked about Memory Management in Java.
A specific question was posed: Why doesn’t Java support Multiple Inheritance?
I was asked in-depth questions about the projects I worked on during my internships.
The interviewer inquired about the technologies I used during my internships.
I was asked to explain my approach to the problem I solved in the pre-interview assessment, including discussing its time and space complexity.
I had to write a recursive Fibonacci function and then analyze its time and space complexity.
Summary
I secured an offer for the Specialist Programmer role at Infosys, which involved an online assessment with three coding problems and a subsequent interview round focusing on data structures, algorithms, and system design.
Full Experience
I am a 2024 Computer Science and Engineering graduate from a tier 3 private college. I'm proficient in competitive programming, being a Knight on LeetCode (top 3%) and a Specialist on Codeforces, having solved about 2000 problems across various platforms. My development skills include React.js, Next.js, Node.js, TypeScript, and I am familiar with AWS.
Infosys typically offers packages around 3.5 LPA to freshers. For the Specialist Programmer role, it provides around 9.5 LPA. My college placement team made a small mistake, initially mentioning the 3.5 LPA role, which led to 1900 students appearing for the drive. However, the job description and pre-placement talk clarified that only the Specialist Programmer role was available.
Online Assessment (OA):
The OA was conducted on campus under strict invigilation. It comprised 3 questions with a total time limit of 3 hours. The catch was that once I moved to the next question, I couldn't go back. I decided to allocate 1 hour per question.- Question 1: This was the hardest. It involved a segment tree. I usually copy my segment tree class in contests, but copy-pasting was disallowed. I spent half an hour trying to implement it from scratch but couldn't. I then tried brute force and an optimized brute force, but both failed all hidden test cases. I'd rate this around Codeforces 1700-1800 level.
- Question 2: An ad-hoc problem, roughly Codeforces 1600 level. I don't recall the exact question, but it involved a small observation, possibly related to caching the last visited index. I solved it in 30 minutes. By this point, 70% of candidates had already quit.
- Question 3: A straightforward recursion question to explore all possible combinations. There were no repeating sub-problems, so memoization wasn't required. I solved it in 15 minutes. This was comparable to a LeetCode second Medium question during contests.
Out of 1900 students, only 12 were called for the interview.
Interview:
My interview began with a short introduction. Then, I was given a quick tree problem to test my knowledge of tree traversal (DFS or BFS), which took about 5 minutes.The main challenge was to Design an LFU Cache. I hadn't studied LFU since my second year. The interviewer explained the problem statement and his expectations, then left the room. I thought about the problem, recalling the necessary data structures like LinkedLists and HashMaps. The logic magically started falling into place, and I had the solution. Once the logic was clear, coding it wasn't an issue. I wrote the code and drew a proper, color-coded diagram to explain my solution, which took about 10 minutes. When he returned, he was somewhat surprised by my speed. He reviewed my code, asked a few questions about specific lines, and I clarified everything to his satisfaction.
He then moved to system design. He asked: "Given a list with filters, such as a list of orders for an e-commerce site, how will you optimize when a user wants to filter the list by COD or prepaid?" I explained that with a simple filter, we would have to go through the complete database. For an on-off logic filter like COD/not-COD, I suggested storing separate tables for COD and prepaid orders. He then mentioned this wouldn't work well for write-heavy systems. I tried to come up with a different approach, but after about 2 minutes, he ended the discussion and asked if I had any questions for him. He might have asked other system design questions that I don't distinctly remember.
I received the result after one day. Out of the 12 interviewees, 6 were selected, and I was one of them.
Interview Questions (2)
Design and implement an LFU Cache. I was expected to recall and apply appropriate data structures like LinkedLists and HashMaps to build the logic.
Given a list of orders for an e-commerce site with filters, how would you optimize filtering when a user wants to filter the list by 'Cash on Delivery (COD)' or 'Prepaid' options? The interviewer specifically questioned my initial approach, stating it wouldn't work for write-heavy systems.
Preparation Tips
For the Infosys Specialist Programmer role, I believe being very strong with Data Structures and Algorithms is crucial, which I gained through competitive programming. Additionally, I recommend going through system design articles on Medium and reading about the famous design patterns—singleton, factory, decorator, etc. (focus on the 6-7 most important ones). The expectation isn't to code and implement these patterns, but to be able to draw some boxes and explain what is happening within them.
Summary
I recently interviewed for the sp role at infosys, where I was presented with a variety of data structure and algorithm questions, including a specific problem on removing adjacent duplicates.
Full Experience
I had my interview for the sp role at infosys. The session was primarily focused on coding, covering multiple data structures and algorithms. I recall being asked questions related to arrays, stacks, dynamic programming, and binary trees. One of the array-based questions specifically involved logic to remove adjacent duplicates from a sequence.
Interview Questions (1)
The problem involved processing a sequence (likely a string or an array) and removing any adjacent duplicate elements. For example, if the input was 'azxxzy', after removing 'xx', it would become 'azzy'. Subsequently, removing 'zz' would yield 'ay'.
Summary
I participated in HackWithInfy 2022, securing a top rank which led to a Pre-Placement Interview opportunity for the Specialist Programmer role at Infosys. After a coding round on LRU Cache and several theoretical questions on OOPS and DBMS, I successfully received an offer.
Full Experience
I appeared in HackWithInfy 2022, an all-India coding competition organized by Infosys. I secured an Under 100th Rank in it, which earned me a Pre-Placement Interview opportunity for the Specialist Programmer role at Infosys. I also moved into the Grand Finale, which was organized in Infosys Pune Development Centre from August 25-29, 2022.
The HackWithInfy Round 1 consisted of 3 problem-solving questions. These included an easy brute force problem, a medium problem based on a Greedy algorithm, and a hard problem based on Dynamic Programming. I was allowed to solve these using C++, Java, or Python.
HackWithInfy Round 2 was a video interview with an interviewer conducted on Microsoft Teams, lasting less than an hour. First, he asked me to introduce myself. After my introduction, he immediately asked a very famous LeetCode question: LRU Cache. As I had solved this question previously, I quickly recalled the approach and started working on it.
After the coding question, he moved on to the theory part. He asked me OOPS questions, specifically covering the Pillars of OOPS (Abstraction, Encapsulation, Inheritance, Polymorphism). He delved deeper into Abstraction and then Inheritance, including its types, Multiple Inheritance, and Multilevel Inheritance.
Next, he questioned me on DBMS concepts. These included What are ACID properties, the difference between WHERE and HAVING clauses, What is Normalization and its types, and What is multivalued dependency.
Finally, he asked about my project which I had mentioned in my resume. The questions were not deep, just about the tech stacks I used and the motivation behind my project.
My verdict was: Selected.
Interview Questions (8)
Design and implement a data structure for a Least Recently Used (LRU) cache. It should support the following operations: get and put. get(key): Get the value of the key if the key exists in the cache, otherwise return -1. put(key, value): Set or insert the value if the key is not already present. When the cache reaches its capacity, it should invalidate the least recently used item before inserting a new item.
Explain the four fundamental pillars of Object-Oriented Programming: Abstraction, Encapsulation, Inheritance, and Polymorphism.
Describe the concept of Abstraction in Object-Oriented Programming. Provide examples of how it's achieved.
Elaborate on the concept of Inheritance in OOP. Discuss different types of inheritance, specifically focusing on Multiple and Multilevel Inheritance.
Describe the ACID properties (Atomicity, Consistency, Isolation, Durability) in the context of database transactions.
Explain the key differences between the WHERE and HAVING clauses in SQL, and when each should be used.
What is database Normalization? Discuss its importance and various normal forms (e.g., 1NF, 2NF, 3NF, BCNF).
Define and explain the concept of Multivalued Dependency in database theory.
Summary
I participated in the HackWithInfy 2022 coding competition, securing a rank within the top 100 which led to a pre-placement interview opportunity. Following a successful video interview, I received an offer for the Specialist Programmer role.
Full Experience
I appeared in HackWithInfy 2022, an all-India coding competition organized by Infosys. I managed to secure an Under 100th Rank in the competition, which earned me a Pre-Placement Interview Opportunity for the Specialist Programmer role at Infosys. I also qualified for the Grand Finale, which was organized in Infosys Pune Development Centre from August 25 to August 29, 2022.
HackWithInfy Round 1:
This round consisted of three problem-solving questions. I could choose to solve them using C++, Java, or Python.
- Question 1: This was an easy question, and a brute-force approach worked. It was similar to the classic Coin Change problem.
- Question 2: A medium-difficulty question based on a greedy algorithm.
- Question 3: A hard-difficulty question based on dynamic programming.
HackWithInfy Round 2:
This was a video interview conducted on Skype, lasting for approximately one hour. The interviewer started by asking me to introduce myself. During my introduction, I mentioned my proficiency in problem-solving, data structures, and algorithms, which prompted the interviewer to ask me a coding question.
Coding Question: Given two strings, I had to make both strings equal by deleting exactly one character from either of the strings in minimum steps. In one step, I could delete one character from either string.
This question is available on LeetCode: Delete Operation for Two Strings.
After the coding question, the interviewer moved on to the theoretical part. She asked me several OOPs questions:
- Abstraction
- Inheritance, types of inheritance, Multiple and Multilevel inheritance
Next, she inquired about DBMS concepts:
- What is indexing
- What are views
- What are ACID properties
- Difference between WHERE and HAVING clause
- What is a trigger
Finally, she asked me some basic questions about the projects I had mentioned on my resume.
Interview Questions (9)
This was an easy problem where a brute-force approach worked. The problem's concept was similar to the classic Coin Change problem.
The interviewer asked me to explain the concept of Abstraction in Object-Oriented Programming.
I was asked about Inheritance, its various types, including Multiple and Multilevel Inheritance, and to explain each concept.
I was asked to explain what indexing is in Database Management Systems.
The interviewer inquired about the concept of Views in Database Management Systems.
I was asked to explain the ACID properties (Atomicity, Consistency, Isolation, Durability) in database transactions.
The interviewer asked about the key differences between the WHERE and HAVING clauses in SQL.
I was asked to define and explain what Triggers are in Database Management Systems.
Preparation Tips
For the HackWithInfy coding rounds, I prepared by practicing problem-solving and honing my skills in data structures and algorithms. For the subsequent video interview, my focus was on reinforcing my problem-solving abilities, Data Structures and Algorithms knowledge, Object-Oriented Programming (OOPs) concepts, and Database Management Systems (DBMS). I also reviewed the projects listed on my resume.
Summary
I participated in the HackWithInfy 2022 coding competition, securing a top rank that led to a Pre-Placement Interview opportunity for the Specialist Programmer role at Infosys, ultimately resulting in an offer.
Full Experience
I had the opportunity to participate in HackWithInfy 2022, an all-India coding competition organized by Infosys. My performance in the competition, where I secured an Under 100th Rank, earned me a Pre-Placement Interview opportunity for the Specialist Programmer role at Infosys. This success also qualified me for the Grand Finale, which was held at the Infosys Pune Development Centre from August 25-29, 2022.
HackWithInfy Round 1: Coding Competition
This round featured three problem-solving questions. The first question was relatively easy and could be solved with a brute-force approach, bearing similarities to the coin change problem. The second question was of medium difficulty and revolved around a greedy algorithm. The final question was a hard problem requiring dynamic programming.
HackWithInfy Round 2: Video Interview
This was a 1-hour video interview conducted via Skype. The interviewer began by asking me to introduce myself. During my introduction, I highlighted my strengths in problem-solving, data structures, and algorithms. Based on this, she presented a coding challenge:
Coding Question:
The problem required me to work with two given strings and make them equal by deleting exactly one character from either string in the minimum number of steps. Each step allowed me to delete one character from either string.
This question is available on LeetCode: Delete Operation for Two Strings.
After discussing the coding question, the interview shifted towards theoretical topics:
OOPs Questions:
- What is Abstraction?
- Explain Inheritance, its types, specifically Multiple and Multilevel Inheritance.
DBMS Questions:
- What is Indexing?
- What are Views?
- What are ACID properties?
- What is the difference between WHERE and HAVING clauses?
- What is a Trigger?
Finally, the interviewer asked some basic questions about the projects I had mentioned on my resume.
Interview Questions (8)
The interviewer asked me to explain Abstraction.
I was asked about Inheritance, its various types, specifically Multiple and Multilevel inheritance.
The interviewer asked me to explain what indexing is in a Database Management System.
I was asked to describe what views are in DBMS.
I had to explain the ACID properties in the context of database transactions.
The interviewer inquired about the difference between the WHERE and HAVING clauses in SQL.
I was asked to define what a trigger is in a Database Management System.
Summary
I received an offer from Infosys for the Digital Specialist Engineer role after a virtual interview through the HackWithInfy program. The interview covered technical core subjects, project discussions, and behavioral questions; no coding questions were asked in my case.
Full Experience
I secured an offer from Infosys for the Digital Specialist Engineer (DSE Profile) role through the HackWithInfy program. My interview, initially scheduled for May 13th, was rescheduled to June 30th due to the interviewer's absence. It was conducted virtually via Microsoft Teams and lasted about 30-35 minutes. The questions flowed from a self-introduction to detailed project discussions, performance-related queries for my application (as I had Flutter experience), and core subject topics like Operating Systems, Computer Networks, and Data Structures. Interestingly, I wasn't asked any coding questions, though some of my friends interviewing for the same profile did face them. I received my results within two weeks and was selected.
Interview Questions (11)
Brief me about yourself.
Demonstration of one of the projects that I mentioned in my resume. As I had experience in Flutter development and described the same in my self-intro, I think that's why I was asked to show the project.
Performance-related questions to my application. Like how will you handle multiple users at a time, what if there's an issue with the server, etc?
Discuss the advantages and disadvantages of Flutter.
What is a deadlock?
Describe CPU scheduling algorithms. He also asked me about preemptive & non-preemptive scheduling algorithms.
What is a Network Protocol?
Differentiate between TCP & UDP. He also asked me which is faster and why?
What are BFS & DFS? After I answered, He also asked me about the data structures used in BFS and DFS.
Why do you want to join Infosys?
Do you have any questions for me?
Preparation Tips
I focused intensely on preparing my resume, ensuring that all projects, achievements, and technologies mentioned were thoroughly understood as I anticipated questions directly from it. Mock interviews with friends were a crucial part of my preparation, providing valuable practice. Furthermore, I dedicated significant effort to mastering core computer science subjects such as Operating Systems, Database Management Systems, Object-Oriented Programming, and Computer Networks, recognizing their fundamental importance for the technical rounds.