Infosys Interview Experience 17 August 2026

The Infosys on-campus technical interviews conducted on 17 August 2026 covered a combination of DSA, SQL, OOPs, DBMS, Operating Systems, AWS, projects and resume-based questions.

The coding section included two DSA problems, with questions coming from topics such as Dynamic Programming, Bit Manipulation, Sliding Window and Greedy. (WINGSPAN)

The difficulty and follow-up questions varied from student to student. Some candidates were able to solve one coding problem, while others were moved toward basic technical and resume-based questions after struggling with the coding section.

Below are the different interview experiences and question patterns reported from the 17 August interview cycle.

---

Student 1 – Dynamic Programming + Bit Manipulation

The interview started with two coding problems. The student was able to solve the first problem and explain the approach and time complexity.

DSA Question 1: Maximum Sum of Non-Adjacent Elements

Topic: Dynamic Programming

The student was asked to find the maximum possible sum from an array while ensuring that no two selected elements were adjacent.

The student explained the DP state and recurrence and successfully completed the solution.

Key concepts:

• DP state
• Recurrence relation
• Space optimization
• Time complexity

DSA Question 2: Find the Unique Element Using XOR

Topic: Bit Manipulation

The second problem involved finding the element that appears only once when other elements occur multiple times.

The interviewer discussed the XOR approach with the candidate, but the student did not completely implement the second solution.

SQL Questions

The interviewer then moved to SQL:

• What is a primary key?
• What is a foreign key?
• Difference between WHERE and HAVING
• What is GROUP BY?
• Explain INNER JOIN
• Write a query to find duplicate records

Other Technical Questions

• Explain the four pillars of OOPs.
• What is polymorphism?
• Difference between process and thread.
• Explain one project from your resume.
• What was your contribution to the project?

• Design a Notes Application that can support millions of users. — HLD

•  Design Student, Subject, Note and PDF classes. — LLD

Overall: The student successfully solved one DSA problem and then faced SQL, OOPs and resume-based questions.

---

Student 2 – Sliding Window + Greedy

The second interview had a different combination of coding topics.

DSA Question 1: Longest Substring Without Repeating Characters

Topic: Sliding Window

The student was asked to find the length of the longest substring containing no repeated characters.

The candidate identified the Sliding Window technique and used a data structure to keep track of the characters currently present in the window.

The solution was successfully explained and implemented.

DSA Question 2: Minimum Number of Coins

Topic: Greedy

The second problem required selecting elements/coins using a Greedy strategy to reach the required target.

The interviewer asked the student to explain why the Greedy approach would work.

The student explained the approach but could not complete the complete implementation.

SQL Questions

The interviewer then asked SQL questions:

• INNER JOIN vs LEFT JOIN
• What is a self join?
• What is normalization?
• Difference between DELETE, DROP and TRUNCATE
• Write a query to find the second-highest salary
• What is the use of aggregate functions?

OOPs Questions

• What is inheritance?
• Method overloading vs method overriding
• What is abstraction?
• Explain encapsulation with an example.

Resume Questions

What is the difference between a process and a thread?

What is Docker and why is it used?

 Explain horizontal and vertical scaling.

The interviewer also asked about one project

mentioned on the resume and the technologies used in it.

Overall: One coding problem was solved successfully, followed by SQL, OOPs and project questions.

---

Student 3 – Could Not Complete DSA + Core Technical Questions

The third candidate received two coding problems but struggled with both.

DSA Question 1: Maximum Subarray Sum

Topic: Dynamic Programming / Kadane’s Algorithm

The candidate was asked to find the maximum sum of a contiguous subarray.

The student discussed the possible approach but was unable to complete the solution during the interview.

DSA Question 2: Count Set Bits in an Integer

Topic: Bit Manipulation

The second problem focused on counting the number of set bits in a binary representation of an integer.

The interviewer discussed the basic approach with the candidate, but the student could not complete the implementation.

Instead of continuing with difficult DSA questions, the interviewer moved toward basic technical questions.

SQL Questions

The candidate was asked:

• What is a database?
• What is a primary key?
• What is normalization?
• What is a JOIN?
• Difference between DELETE and TRUNCATE
• What is a foreign key?
• Write a basic SQL query using GROUP BY

Core CS Questions

OOPs

• Class vs object
• What is inheritance?
• What is polymorphism?

Operating Systems

• Process vs thread
• What is deadlock?
• What are the necessary conditions for deadlock?

DBMS

• What is normalization?
• What is indexing?
• What is a transaction?

Resume Questions

The interviewer asked the candidate to explain:

• Major project
• Technologies used
• Individual contribution
• Challenges faced during development

Overall: The candidate could not complete the coding problems, so the interview focused more on basic DSA concepts, SQL, core subjects and resume questions.

---

Student 4 – Sliding Window + Bit Manipulation

The fourth candidate successfully solved one coding problem.

DSA Question 1: Maximum Consecutive Ones

Topic: Sliding Window

The candidate was asked to determine the longest sequence of consecutive 1s under the given condition.

The student recognized the Sliding Window approach and explained the window expansion and contraction logic.

DSA Question 2: Power of Two Using Bit Manipulation

Topic: Bit Manipulation

The second problem involved determining whether a number is a power of two using bitwise operations.

 

SQL Questions

The SQL discussion included:

• What is a JOIN?
• INNER JOIN vs LEFT JOIN
• What is GROUP BY?
• What is HAVING?
• Write a query to find the maximum salary
• What is a subquery?
• Difference between primary key and unique key

AWS Questions

Because AWS was included in the student’s resume, the interviewer asked:

• What is AWS?
• What is EC2?
• What is S3?
• What is IAM?
• Difference between EC2 and S3
• Which AWS service did you use in your project?
• Why did you choose AWS?

Project Questions

• Explain your project architecture.
• What APIs did you use?
• What was your role?
• What was the biggest technical challenge?

• Design a large-scale Chat System capable of handling millions of users. — HLD

• Design User, Chat, Message, Conversation and Response classes. — LLD

Overall: One DSA problem was solved, followed by SQL, AWS and project-based questions.

---

Student 5 – Greedy + Dynamic Programming + SQL

The fifth candidate was able to solve one of the two coding questions.

DSA Question 1: Activity Selection Problem

Topic: Greedy

The candidate was asked to select the maximum number of non-overlapping activities based on their start and finish times.

The student explained the Greedy strategy of sorting activities according to their finishing time and successfully solved the problem.

DSA Question 2: Minimum Cost to Reach the End

Topic: Dynamic Programming

The second problem required calculating the minimum cost required to reach the final position using previously calculated states.

 

SQL Questions

The interviewer spent considerable time on SQL:

• What is a JOIN?
• INNER JOIN vs LEFT JOIN
• What is GROUP BY?
• What is HAVING?
• Find the second-highest salary
• Find duplicate records
• DELETE vs DROP vs TRUNCATE
• What is normalization?
• Write a query using two tables

DBMS Questions

• What are ACID properties?
• What is normalization?
• What is a candidate key?
• Primary key vs foreign key
• What is indexing?

Resume Questions

The candidate was asked about:

• Final-year project
• Technical stack
• Personal contribution
• Database used
• Challenges faced
• Future improvements

Overall: The candidate solved one DSA problem and then faced a detailed discussion around SQL, DBMS and the resume.

---

Common Infosys Interview Questions Asked

Across these experiences, candidates should particularly prepare the following areas.

DSA

• Dynamic Programming
• Bit Manipulation
• Sliding Window
• Greedy
• Arrays
• Strings
• Searching
• Sorting
• Trees
• Graphs

SQL

Important SQL topics include:

• SELECT
• WHERE
• GROUP BY
• HAVING
• ORDER BY
• Aggregate functions
• INNER JOIN
• LEFT JOIN
• RIGHT JOIN
• Subqueries
• Primary Key
• Foreign Key
• DELETE
• DROP
• TRUNCATE
• Duplicate records
• Second-highest salary

OOPs

Prepare:

• Class and Object
• Encapsulation
• Abstraction
• Inheritance
• Polymorphism
• Method Overloading
• Method Overriding
• Constructor

DBMS

Important areas:

• Keys
• Normalization
• Transactions
• ACID properties
• Indexing
• Joins
• SQL queries

Operating Systems

• Process vs Thread
• Deadlock
• CPU Scheduling
• Memory Management
• Paging
• Synchronization

Resume & Projects

Do not ignore your resume.

The interviewer can ask questions directly from technologies you have mentioned, including AWS, Java, Python, SQL, A React, Machine Learning or other development technologies.

Be prepared to explain your project from:

Problem → Architecture → Technology → Your Contribution → Challenges → Solution → Result

Final Preparation Strategy

For an Infosys technical interview, preparing DSA alone may not be enough.

A good preparation combination is:

DSA + SQL + OOPs + DBMS + OS + Resume + Projects

For DSA, focus particularly on understanding the approach and complexity, rather than memorizing code.

For SQL, practice writing queries yourself.

And most importantly, be ready to explain every project and technology mentioned on your resume.

Infosys Interview Experience 17 August 2026 therefore gives a useful indication of the broad preparation required: candidates should be comfortable with coding as well as the fundamentals of computer science and their own project work.