Infosys HackWithInfy: Coding contest to Power Programmer and Specialist Programmer roles
HackWithInfy is Infosys's coding contest for students, feeding specialist roles such as Power Programmer and Specialist Programmer. Guides describe registration, an online coding round, a Grand Finale for top performers, and an interview. Sources disagree on round lengths, the finale format and how solved problems map to roles, and package figures vary widely, so treat this kit as practice and check Infosys's official HackWithInfy page.
25 questions · 3 rounds · updated Nov 2026
How the interview works
- Online coding round: Three problems of rising difficulty in a few hours; fully passing problems count most.
- Grand Finale: For top performers; reported as a long contest or hackathon, details vary.
- Interview: Combined technical and HR with coding depth.
Sample questions
- 01
Walk me through the project on your resume you are most proud of.
MediumProject
Model answer
What the interviewer checks
Depth and ownership. Expect five or six follow-up "why" questions: why that database, what broke, what you would change at ten times the scale.
How to answer
Use this order and keep the first pass to two minutes: 1. Problem and user: "Students missed placement deadlines because updates were spread across WhatsApp groups." 2. What you built and your part: "A web app where the placement cell posts drives and students get reminders. I built the backend in Spring Boot and designed the MySQL schema." 3. One hard technical decision: "Reminders had to go out at exact times for 1,200 students. A cron job polling every minute duplicated messages when the job overran, so I moved to a queue with a unique key per student and drive, which made sending idempotent." 4. Result with a number: "400 active users; missed deadlines reported by the cell fell from about 30 a semester to 4." 5. What you would do differently: "Add tests earlier: a timezone bug reached production because we had none." Prepare answers for: the architecture diagram, the database tables, the hardest bug, how you tested it, how it would handle 100 times the users, and what each teammate did.
Common mistakes
- Describing only features, not decisions.
- Not knowing parts of a group project you list as yours.
- No numbers anywhere.
- 02
Find the maximum sum of a contiguous subarray (Kadane's algorithm). Example: [-2,1,-3,4,-1,2,1,-5,4] → 6 (the subarray [4,-1,2,1])
MediumArrays
Approach and solution
Approach
Walk the array keeping the best sum of a subarray ending here: either extend the previous one or start fresh at this element. Track the best seen. Starting with the first element (not 0) handles all-negative arrays.
def max_subarray(a): best = cur = a[0] for x in a[1:]: cur = max(x, cur + x) best = max(best, cur) return best assert max_subarray([-2, 1, -3, 4, -1, 2, 1, -5, 4]) == 6 assert max_subarray([-3, -1, -2]) == -1Complexity: O(n) time, O(1) space.
- 03
Given an array and a target, return the indices of two numbers that add up to the target (two sum). Example: [2,7,11,15], 9 → [0, 1]
EasyHashing
Approach and solution
Approach
For each number, check whether target − number has been seen; store value → index as you go. One pass, instead of the O(n²) double loop.
def two_sum(a, target): where = {} for i, x in enumerate(a): if target - x in where: return [where[target - x], i] where[x] = i return [] assert two_sum([2, 7, 11, 15], 9) == [0, 1] assert two_sum([3, 3], 6) == [0, 1]Complexity: O(n) time and space.
22 more questions, members only
- Round 1: online coding10
- Grand finale8
- Interview and role assignment7
Members also get how to answer each question and a preparation plan for this company.
See plans from ₹399Every question and answer is written by Hirecept and the code is run before it is published. How a company runs its process comes from candidate reports and public pages, and companies change it, so treat that part as a guide, not a promise.