Infosys Technologies Limited interview experience Real time questions & tips from candidates to crack your interview

Digital Specialist Engineer

Infosys Technologies Limited
upvote
share-icon
2 rounds | 8 Coding problems

Interview preparation journey

expand-icon
Journey
My HackWithInfy Journey: From Coding Round to Interview Room to Selection When I first registered for HackWithInfy, I saw it as more than just a coding competition—it was a chance to test my skills, push my limits, and experience what a real interview process at a top IT company feels like. Looking back, the entire journey was both challenging and rewarding, and I’d love to share my experience here. The Online Coding Round The first round was held in the last week of June. We were given three coding problems to solve within the time limit. I still remember sitting there, thinking through each problem carefully, balancing speed with accuracy. After about two and a half hours, I had successfully solved all three. It was an exhausting but satisfying feeling—the kind of joy that only comes from seeing all the test cases turn green. Shortlisted for Category 1 A month later, on 23rd July, the results were out. My name appeared on the Category 1 list—the category reserved for students who solved all three problems in the online test. The next step was even bigger: I was invited for a face-to-face interview on 29th July at the Infosys campus in Hinjewadi, Pune. That’s when the real preparation began—brushing up on DSA, OOPs, DBMS, CN, and OS concepts, and even preparing a short PPT on my inspirations as instructed. Interview Day at Infosys Pune The big day arrived. I reached the Infosys Hinjewadi campus early in the morning, feeling a mix of nervousness and excitement. The HR greeted us and explained the process. Interestingly, before the actual interviews, we were given another coding test—a 45-minute test with two medium-to-hard questions, and we had to solve at least one. I picked a Dynamic Programming (DP) question—challenging but doable. After some intense thinking, I managed to solve it. Technical Interview Experience Soon after, it was my turn. The panelist welcomed me and asked me to introduce myself. Then came the questions: Java basics: What is Java? What does static mean? What are its data types? Is Java platform-dependent? OOPs concepts: The four pillars—Abstraction, Encapsulation, Inheritance, and Polymorphism. DBMS: Joins, normalization, and writing a query to find the second-highest salary. The questions weren’t just about knowledge; they were about clarity. I answered confidently, and the interaction felt more like a conversation than an interrogation. The Feedback Before wrapping up, I asked the panelist for feedback. His words gave me a big confidence boost: “Your DSA and logical thinking are very good.” “You have strong communication skills.” “Always keep revising the basics—that’s where most students fall behind.” Those words stuck with me—they weren’t just feedback for the interview, but advice for my career ahead. The Final Result After the interview, HR told us that results would be shared in about 10 days. The wait felt long, but finally, after 20 days, I received the selection mail. I was officially among the Category 1 students who made it through. Reflections This journey taught me more than just coding—it taught me persistence, preparation, and the importance of fundamentals. Solving problems under time pressure, revising concepts, and facing interviews head-on gave me an experience that I’ll carry forward throughout my career. If I had to sum it up in one line: HackWithInfy was not just a test of skills, but a journey of growth.
Application story
We had to register ourselves to participate in the HackWithInfy event, and then we were shortlisted for the online coding contest.
Why selected/rejected for the role?
I was selected because I was able to solve all three problems in the online coding contest. Additionally, in the interview round, I solved the DP question and answered all the questions asked by the panelist confidently.
Preparation
Duration: 6 Months
Topics: Data Structures and Algorithms, OOPs, DBMS, OS, CN, Java, Python
Tip
Tip

Tip 1: Interviewers primarily focus on how confidently you explain the fundamentals. A clear understanding of core concepts often makes a stronger impression than memorizing advanced topics.

Tip 2: When given a coding problem, aim to solve it within the time limit. If you have doubts, don’t hesitate to clarify them. Most importantly, explain your approach—interviewers value your thought process as much as the final answer.

Tip 3: A solid grasp of core subjects (OOPs, DBMS, OS, CN, etc.), along with consistent practice of DSA problems, will boost both your speed and confidence during technical rounds.

Application process
Where: Campus
Eligibility: No criteria, (Salary Package - 6.25 LPA)
Resume Tip
Resume tip

Tip 1: You need to have full knowledge of everything you mention on your resume.
Tip 2: Do not include false information on your resume.

Interview rounds

01
Round
Medium
Online Coding Test
Duration180 minutes
Interview date22 Jun 2025
Coding problem3

The round was an online test and we had to keep our camera on all the time it was a proctored test and couldn't switch the tabs and there was no chance of doing any malpractices.

1. Dynamic Divisor Path

Moderate
0/80

You are given an array A of N distinct positive integers. You must find the minimum cost to travel from index 0 to index N-1.


From your current index i, you can make two types of forward moves:

Step: Move to the next index, i+1. This move has a cost of 1.


Jump: Move to a future index j (where j > i). This move has a cost of j - i. A jump is only possible if the value at the destination, A[j], is a multiple of the value at your current location, A[i].


There is a special rule: whenever you successfully complete a jump from i to j, the value A[j] is permanently incremented by 1. This change can affect which future jumps are possible.


Your task is to find the minimum possible total cost to reach index N-1.


Problem approach

This is essentially a shortest path problem in a graph:
Each position i in the array is a node.
Moving to i+1 is like an edge of weight 1.
Jumping from i → j is like an edge of weight (j - i) but modifies A[j].
Approach:
Use Dijkstra’s algorithm (priority queue / min-heap) to always explore the minimum-cost path first.
Each state is defined by (index, array configuration).
Keep a visited set to avoid re-computation.
Options at each step:
Option 1: Move to i+1 with cost 1.
Option 2: For all j > i, if A[j] % A[i] == 0, jump to j with cost (j - i) and increment A[j]

Try solving now

2. Maximum Dish Selection

Moderate
0/80

Ramu has N dishes of different types arranged in a row, represented by an array A, where A[i] denotes the type of the i-th dish. He wants to choose the maximum possible number of dishes, but he must adhere to two conditions:


1) He can only choose dishes of a single type.


2) No two chosen dishes can be adjacent to each other in the original row.


Your task is to determine which type of dish Ramu should choose to maximize his collection. If there's a tie (i.e., he can achieve the same maximum count with multiple dish types), he will choose the dish type with the smallest numerical value.


Try solving now

3. Base Conversion

Easy
15m average time
85% success
0/40
Asked in companies
UberAdobePayPal

You are given a number ‘N’ as a string in base ‘B’. Your task is to convert ‘N’ in base 10. If it’s impossible to convert ‘N’ into base 10, then you need to print -1.

Note :

1. ‘N’ contains only digits ‘0’ to ‘9’ and English letters ‘A’ to ‘F’.
2. Decimal equivalent of 0 is 0, 1 is 1, . . .9 is 9, A is 10, B is 11, . . . F is 15.
Try solving now
02
Round
Hard
Face to Face
Duration60 minutes
Interview date29 Jul 2025
Coding problem5

This was a 45-minute test with two medium-to-hard questions, and we had to solve at least one. I picked a Dynamic Programming (DP) question—challenging but doable. After some intense thinking, I managed to solve it.

1. NINJA'S JUMP

Hard
15m average time
85% success
0/120
Asked in companies
Morgan StanleyAmazonExpedia Group

Ninja is assigned a task to reach the last stone by his master. These stones are numbered with some value and in the form of an array. He is allowed to jump either odd-numbered jumps or even-numbered jumps and has to reach the last stone.

So your task is to find the number of starting index from which he may start jumping so he reaches the last stones. You are provided with the given array and you have to find the number of starting index of the array from which Ninja can reach the end of the array by jumping some number of times.

For jumping you have to follow below instructions:

You may jump forward from index ‘i’ to index ‘j’ (with i < j) in the following way:

During odd-numbered jumps (i.e., jumps 1, 3, 5, ...), you jump to the index ‘j’ such that ‘arr[i] <= arr[j]’ and ‘arr[j]’ is the smallest possible value. If there are multiple such indices ‘j’, you can only jump to the smallest such index j.

During even-numbered jumps (i.e., jumps 2, 4, 6, ...), you jump to the index ‘j’ such that ‘arr[i] >= arr[j]’ and ‘arr[j]’ is the largest possible value. If there are multiple such indices ‘j’, you can only jump to the smallest such index ‘j’.

Try solving now

2. Java Basics

3. OOPS

Explain the four pillars of OOPS: Abstraction, Encapsulation, Inheritance, and Polymorphism. (Learn)

4. DBMS

5. Second Highest Salary

Write a query to find the second-highest salary. (Practice)

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
Digital Specialist Engineer
3 rounds | 3 problems
Interviewed by Infosys Technologies Limited
1047 views
0 comments
0 upvotes
Digital Specialist Engineer
2 rounds | 3 problems
Interviewed by Infosys Technologies Limited
824 views
0 comments
0 upvotes
Digital Specialist Engineer
2 rounds | 4 problems
Interviewed by Infosys Technologies Limited
1132 views
0 comments
0 upvotes
Digital Specialist Engineer
1 rounds | 2 problems
Interviewed by Infosys Technologies Limited
1150 views
0 comments
0 upvotes