Infosys Interview Questions & Experiences

Infosys·Software Engineer·Technical Phone Screen

Aug 2026

One hour, one-on-one interview for a DSE role at Infosys. Covered a coding problem on WingSpan, a classic SQL query, and then a pretty wide sweep of ML and CS fundamentals pulled from the resume. No intro was asked for, which threw me off slightly, but the pace was manageable.

Given an array of children's greed factors and an array of cookie sizes, find the maximum number of children you can satisfy, where a child is satisfied only if their cookie is at least as large as their greed factor AND both share the same parity (both even or both odd).
Write a SQL query to find the second highest salary.
What are the ACID properties in databases?
What is the ROC-AUC metric, and how does it differ from accuracy? What are their formulas?
A model hits 0.98 accuracy locally but completely fails in production. What could explain that?
What is the vanishing gradient problem, and how do you address it?
What is the difference between bagging and boosting?
What is binary search and what is its time complexity?
Are you familiar with any software design patterns or architectural patterns?

“The parity constraint is what makes this non-trivial.”

View Post

Infosys·Software Engineer·Online Assessment (OA)

Aug 2026

Infosys OA with 4 coding problems in 3 hours. The questions ranged from medium to hard and from what I saw around me, finishing more than 2 was basically unheard of.

Given two equal-length strings S and T, find the minimum number of character replacements to make S an anagram of T. Replacing a vowel with a consonant (or vice versa) costs 1, while swapping within the same category (vowel to vowel, consonant to consonant) costs 2. Characters already balanced across both strings cost nothing.
A modified house robber problem where you cannot rob adjacent houses, and additionally, any two consecutively robbed houses must have profits differing by at least D in absolute value. Maximize total profit.
Partition an array into contiguous groups of at least 3 elements each. The profit from each group is its third-smallest value. Maximize the total profit across all groups, or return -1 if no valid partition exists.
Find the minimum cost path from a start city to a destination in an undirected graph where each node has a visit cost. You have one optional VIP pass: using it on a city makes that city free but doubles the cost of the next city visited. Total cost includes start and end cities.

“This one felt manageable at first.”

View Post

Infosys·Software Engineer·Onsite - Cross-functional / Panel

Aug 2026

Face-to-face panel interview at Infosys for a Digital Specialist Engineer role. Mixed bag: a couple of questions didn't land, but the interviewer seemed genuinely positive by the end and walked through next steps in detail.

Solve a problem involving Trie data structures.
An additional coding problem added outside the planned interview set, requiring brute force and then an optimized solution.
Walk through the system design of one of your past projects.
Write or explain a SQL query related to one of your projects.
Explain your approach and complexity analysis for a given problem.

“Just told them I wasn't confident rather than fumbling through a half-baked answer.”

View Post

Infosys·Software Engineer·Online Assessment (OA)

May 2026

Got wrecked by an Infosys OA. Couldn't even brute force the problem, which says a lot about where my DP skills are right now.

Given an array of coin denominations with unlimited supply and a target amount, find the number of distinct combinations that sum to the target. An additional constraint D is introduced: a combination is only valid if any two distinct denominations used differ by at least D. Using the same denomination multiple times is fine. Return the answer modulo 1000000007.

“Couldn't even get a brute force working, which was pretty embarrassing.”

View Post

Infosys·Software Engineer·Online Assessment (OA)

May 2026

Three algorithmic questions for Infosys, ranging from a warm-up array problem to something that made me genuinely pause. The difficulty ramp was steep and the last one felt a bit unfair for the context.

Given a mountain array (elements first increase then decrease), find the maximum element.
Count the number of ways to reach a target sum using three given numbers, where you cannot use the same number twice consecutively.
Find the longest common substring between two strings where at most one character mismatch is allowed, and the mismatched characters must belong to the same class (both vowels or both consonants).

“Pretty standard warmup.”

View Post

Infosys·Software Engineer·Onsite - Coding / Algorithms

May 2026

Infosys Software Engineer interview with four algorithm problems, ranging from greedy pairing to DP with constraints. The problems were more involved than I expected for this company, especially the climbing stairs one with the jump restriction.

You're given a list of weights and a binary category label for each element. Pair every element such that each pair has one from each category, and the cost of a pair is the max of the two weights. Minimize total cost, or return -1 if valid pairing is impossible.
Partition an array into exactly K contiguous subarrays. Each subarray's value is its alternating sum. Count the number of ways to do this (or meet a target value, the exact condition was a bit unclear).
There are N stairs. You can jump 1, 2, or 3 steps at a time with costs A, B, C respectively. After a 2-step or 3-step jump, you cannot immediately take another multi-step jump. Find the minimum cost to reach the top.
Given suppliers, hubs, and customer demand points, route goods through the hubs to satisfy all demand while minimizing total transportation cost under capacity constraints.

“Sorting by weight and pairing greedily felt right almost immediately, but I second-guessed myself for a bit on whether to sort ascending or descending.”

View Post

Infosys·Software Engineer·Technical Phone Screen

May 2026

Interviewed for a SWE role at Infosys and got a fairly standard CS fundamentals question about garbage collection. Nothing too wild, but it made me realize how rusty I was on the internals.

Can you explain how garbage collection works in programming?

“I knew the basics but fumbled when they pushed on specific algorithms like mark-and-sweep vs reference counting.”

View Post

Infosys·Software Engineer·Hiring Manager Screen

May 2026

Interviewed for a management consultant role at Infosys. Just one question I can remember clearly, and it was more strategic than I expected for what felt like an early-stage conversation.

How would you verify that the budget allocated to a project won't negatively affect its outcomes?

“I fumbled the opening on this one.”

View Post

Infosys·Software Engineer·Technical Phone Screen

May 2026

Interviewed for a data science role at Infosys and got asked to walk through OOP concepts in Python. Pretty standard stuff but it still caught me a bit flat-footed on some of the finer details.

Can you explain the core object-oriented programming concepts as they apply in Python?

“I knew the basics but fumbled a bit trying to explain the difference between method overriding and overloading in Python since Python doesn't really do overloading the traditional way.”

View Post

Infosys·Software Engineer·Hiring Manager Screen

May 2026

Interviewed for a management consultant role at Infosys. One question, pretty focused on project planning fundamentals. Nothing wild but it made me think harder than I expected.

How would you build a resource charter based on a given project scope?

“I started rambling about stakeholder mapping before realizing they probably wanted something more structured around capacity and role allocation.”

View Post