Placement & training teams: 2026–27 campus calendars are being locked now. Request a proposal →

Recruiter guide · IT Services (Mass + Premium)

How Infosys hires freshers.

3 rounds, 3.6 LPA, and exactly what each round tests. Built from public hiring data and reported interview questions.

Mass + Premium tierHiring in 2025-26Mysuru · Pune · Hyderabad · Chennai
See the 3 rounds
DifficultyHard
Package, approx3.6 LPA
on a 0-60 LPA scale
Rounds3
resume to offer
Timeline4-12 monthsHackWithInfy: Round 1 → Round 2 / PPI → offers
Evidence100+interview questions reported

Company snapshot

Who Infosys hires, and how.

How Infosys hiresHiring channels
  • Off campus

    HackWithInfy (coding contest → PPI for SP/DSE), InfyTQ / campus drives, off-campus drive for 2025 grads (announced Oct 2025)

Fresher hiring in 2025-26What the latest cycle looked like
  1. 2025

    Oct 16 2025: Infosys CFO announced off-campus drive for 2025 CS/IT/circuit grads with SP L1-L3 (11/16/21 LPA) and DSE (7 LPA)

  2. 2025-26

    12,000 freshers hired H1 FY26, target 20,000 FY26

  3. 2025-26

    HackWithInfy runs annually (registrations ~Mar-May for pre-final years)

Tech stack
JavaPython.NETSQLInfosys Finaclecloud
Offices in India
MysuruPuneHyderabadChennai
Listed (NSE: INFY)

Routes in

5 ways in. One bar to clear.

Each route, the role and package it leads to, and its steps.

On-campus

Campus / off-campus System Engineer & System...

5.0-5.5 LPAJL3 specialist trainee

Campus: Aug-Feb, off-campus: rolling

  1. 1Online test
  2. 2Technical interview
  3. 3HR interview
Official page ↗
Off-campus drive

Specialist Programmer & Digital Specialist Engineer...

6.25-7 LPADSE

Several windows a year (off-campus, e.g.

  1. 1Online coding test
  2. 2Technical interview
  3. 3HR interview
Official page ↗
Hackathon / Coding contest

HackWithInfy

interview opportunityPPI

Registration ~Mar-May, rounds Jun-Aug

  1. 1Round 1 online contest
  2. 2Round 2 contest
  3. 3Grand Finale hackathon
  4. 4Interview
Official page ↗
National test (e.g. NQT)

InfyTQ certification route

historical 3.6 / 6.25 / 9.5SE/DSE/SP

Discontinued (last ~2023)

  1. 1Certification exam
  2. 2Interview
Official page ↗
Internship → PPO

InStep global internship

stipendIntern

Applications rolling (summer & winter cohorts)

  1. 1Online application
  2. 2Interview
  3. 3Internship
Official page ↗
CTC breakup, approxApprox: SE in-hand ~25k/monthDSE fixed ~6.25L + variableSP L1 ~11L fixed-heavy

The hiring process

3 rounds, one hiring committee.

Every round in order: what happens, what was asked, and how to clear it.

1
Coding AssessmentOnline proctored (hackerearth / infosys platform) · 180 min · HackWithInfy Round 1 / SP-DSE Online Test
Eliminates
  • 3 coding problems: Q1 easy-medium (greedy/math), Q2 medium (DP/greedy), Q3 hard (DP on trees/graphs, segment tree, bitmask DP)
  • Role mapped by score: ~1 full solve → DSE interview, 2-3 solves → SP
  • Top ~100 of HackWithInfy eligible for Power Programmer
  • Some SP/DSE off-campus tests add MCQ section on pseudo-code, DBMS/SQL, OOP
DPGraphsGreedyNumber theorySegment trees

Tip Secure partial scores on all 3; use C++/Java for speed; write brute force for Q3 to get partial test cases.

Asked in this round
  1. Maximize sum choosing elements with constraint on adjacent indices (DP)
  2. Count subsets with XOR equal to K (bitmask DP)
  3. Minimum cost to make all tree nodes equal (tree DP)
2
Technical InterviewVirtual (infosys platform/teams) · 30-60 min (longer for SP)
Eliminates
  • Discuss code from assessment, live coding 1-2 problems, CS fundamentals, project deep dive
  • SP interviews add advanced DSA and sometimes system design/AI questions
DSAOOPDBMS/SQLOSNetworking

Tip Revise your own assessment code; have 1-2 strong projects.

Asked in this round
  1. Explain your assessment solution and its complexity
  2. HashMap internals and collision handling
  3. Write SQL for second highest salary
3
HRVirtual · 10-20 min (often merged with technical)
Scored

Standard HR + documents, relocation, Mysuru training

FitFlexibility

Tip Say yes to relocation and technology flexibility.

Asked in this round
  1. Why Infosys?
  2. Willing to relocate and work on any technology?
  3. What do you know about Infosys Springboard?

What gets tested

Where Infosys spends its interview time.

Coding topics by shareShare of reported Infosys DSA questions
  • Arrays & Hashing22%
  • Strings14%
  • Dynamic Programming13%
  • Tries / Bit / Math9%
  • Two Pointers & Sliding Window7%
  • Graphs6%
  • Binary Search5%
  • Stack & Queue5%
Focus areasHow often each area comes up
Asked a lot
DSA depthOSDBMSOOP / Design PatternsSQLAptitude TestCommunication TestProjects / ResumeBehavioral / HM
Sometimes
Computer NetworksLanguage / Systems
Rarely
LLD / Machine CodingHLD / System DesignPuzzles / Probability
What got students the offer
  • Practice CP-style hard DP
Why students were rejected
  • Zero full solves in assessment
  • Unable to explain own code
  • Weak fundamentals for SP level

How to prepare

What to study, area by area.

Coding and DSA
  • Competitive programming: Codeforces 1400-1800 / CodeChef 3-4 star level for SP
  • DP (bitmask, tree, digit), graphs, segment tree/BIT, greedy proofs
  • DSE: LeetCode medium
Practise
  1. Delete Operation for Two Strings (LC 583)
  2. Count subsets with XOR equal to K (bitmask DP)
  3. House Robber variant (LC 198)
  4. Minimum cost to make tree nodes equal (tree DP)
CS fundamentals
  • OOP, DBMS (normalization, ACID), OS (deadlock, scheduling), networking (TCP/UDP, HTTP/HTTPS)
Practise
  1. HashMap internals and collision handling
  2. Process vs thread; deadlock prevention
  3. Abstract class vs interface
  4. Four pillars of OOP
System design
  • Not formally tested for DSE
  • SP may get high-level design / scaling discussion
Behavioural and language
  • Pseudo-code MCQs in some off-campus tests
  • HR flexibility answers
  • Infosys Springboard courses help
Resources candidates usedHackWithInfy previous questions (GFG, PrepInsta), Codeforces/CodeChef practice, CSES problem set (DP/graphs), Infosys Springboard, placementpreparation.io HackWithInfy mocks

Interview questions

Questions Infosys actually asked.

From candidate reports, 2024-26. Filter by type.

  1. 01

    Count subsets with XOR equal to K (bitmask DP)

    DSA / CodingCoding Assessment
  2. 02

    Minimum cost to make all tree nodes equal (tree DP)

    DSA / CodingCoding Assessment
  3. 03

    Shortest path with at most K edges (modified Dijkstra/Bellman-Ford)

    DSA / CodingCoding Assessment
  4. 04

    House Robber variant (LC 198)

    DSA / CodingCoding Assessment
  5. 05

    Minimum cost to make tree nodes equal (tree DP)

    DSA / CodingCoding Assessment
  6. 06

    Shortest path with at most K edges (LC 787 style)

    DSA / CodingCoding Assessment
  7. 07

    Reverse a string / check palindrome

    DSA / CodingCoding Assessment
  8. 08

    Second largest element in an array

    DSA / CodingCoding Assessment
  9. 09

    Maximize sum choosing elements with constraint on adjacent indices (DP)

    Puzzle / ProbabilityCoding Assessment
  10. 10

    Greedy problem (medium)

    DSA / CodingRound 1 – HackWithInfySource ↗
  11. 11

    DP problem (hard)

    DSA / CodingRound 1 – HackWithInfySource ↗
  12. 12

    Coin-change-like problem (easy)

    Technical / OtherRound 1 – HackWithInfySource ↗
  13. 13

    Fibonacci series without using a temporary variable

    DSA / CodingRound 1 – HackWithInfy OASource ↗
  14. 14

    ArrayList-related problem

    DSA / CodingRound 1 – HackWithInfy OASource ↗
  15. 15

    Exception handling coding problem

    DSA / CodingRound 1 – HackWithInfy OASource ↗
  16. 16

    Bulbs toggle problem – bit manipulation (alternating bits)

    DSA / CodingRound 1 – OASource ↗
  17. 17

    Count warships (Number of Islands variant) via DFS

    DSA / CodingRound 1 – OASource ↗
  18. 18

    Segment tree problem (~CF 1700-1800)

    DSA / CodingRound 1 – OASource ↗
  19. 19

    Tree traversal DFS/BFS

    DSA / CodingRound 1 – OASource ↗
  20. 20

    Ad-hoc problem with key observation – cache last index visited (~CF 1600)

    CS FundamentalsRound 1 – OASource ↗
  21. 21

    Recursion – explore all combinations

    HR / BehavioralRound 1 – OASource ↗
  22. 22

    Variations of Fibonacci, LIS, LCS (other candidates)

    DSA / CodingRound 1 – Offline codingSource ↗
  23. 23

    Rate limiting to prevent API abuse)

    CS FundamentalsRound 1 – System DesignSource ↗
  24. 24

    URL shortener: 1M DAU, 1:10000 write:read, multi-region low latency)

    HLD / System DesignRound 1 – System DesignSource ↗
  25. 25

    Caching to reduce DB access)

    Technical / OtherRound 1 – System DesignSource ↗
  26. 26

    Diagnose inconsistent per-user latency)

    Technical / OtherRound 1 – System DesignSource ↗
  27. 27

    Climbing Stairs

    DSA / CodingRound 2 – Basic DSA/CSSource ↗
  28. 28

    Swap two numbers without a third variable

    DSA / CodingRound 2 – Basic DSA/CSSource ↗
  29. 29

    Merge Sort

    DSA / CodingRound 2 – Basic DSA/CSSource ↗
  30. 30

    Deadlock prevention and handling

    CS FundamentalsRound 2 – On-site...Source ↗
  31. 31

    Inheritance, polymorphism, encapsulation

    CS FundamentalsRound 2 – On-site...Source ↗
  32. 32

    Career aspirations

    Aptitude / MCQRound 2 – On-site...Source ↗
  33. 33

    Machine learning and ReactJS key terms

    Technical / OtherRound 2 – On-site...Source ↗
  34. 34

    Quick Sort)

    DSA / CodingRound 2 – TechnicalSource ↗
  35. 35

    Abstraction

    CS FundamentalsRound 2 – Video interviewSource ↗
  36. 36

    Inheritance – types, multiple, multilevel

    CS FundamentalsRound 2 – Video interviewSource ↗
  37. 37

    What is indexing?

    CS FundamentalsRound 2 – Video interviewSource ↗
  38. 38

    ACID properties

    CS FundamentalsRound 2 – Video interviewSource ↗
  39. 39

    Delete Operation for Two Strings (LeetCode 583)

    Aptitude / MCQRound 2 – Video interviewSource ↗
  40. 40

    What are views?

    HR / BehavioralRound 2 – Video interviewSource ↗
  41. 41

    What is a trigger?

    HR / BehavioralRound 2 – Video interviewSource ↗
  42. 42

    Explain your assessment solution and its complexity

    DSA / CodingTechnical Interview
  43. 43

    HashMap internals and collision handling

    DSA / CodingTechnical Interview
  44. 44

    Write SQL for second highest salary

    SQLTechnical Interview
  45. 45

    Second highest salary

    SQLTechnical Interview
  46. 46

    Joins between employee and department

    SQLTechnical Interview
  47. 47

    GROUP BY with HAVING

    SQLTechnical Interview
  48. 48

    Process vs thread; deadlock prevention

    CS FundamentalsTechnical Interview
  49. 49

    Abstract class vs interface

    CS FundamentalsTechnical Interview
  50. 50

    Four pillars of OOP

    CS FundamentalsTechnical Interview
  51. 51

    Normalization 1NF-3NF

    CS FundamentalsTechnical Interview
  52. 52

    How would your project scale to 10x users?

    HLD / System DesignTechnical Interview
  53. 53

    Why Infosys?

    HR / BehavioralHR
  54. 54

    Willing to relocate and work on any technology?

    HR / BehavioralHR
  55. 55

    What do you know about Infosys Springboard?

    HR / BehavioralHR
  56. 56

    Any backlogs or gaps?

    HR / BehavioralHR
  57. 57

    OOP basics

    CS FundamentalsRound 3 – HRSource ↗
  58. 58

    Rate yourself out of 5 on each resume skill

    Project / ResumeRound 3 – HRSource ↗
  59. 59

    HTML/CSS basics

    HR / BehavioralRound 3 – HRSource ↗
  60. 60

    ER diagrams

    DSA / CodingRound 3 – TechnicalSource ↗
  61. 61

    Advantages and disadvantages of AI

    DSA / CodingRound 3 – TechnicalSource ↗
  62. 62

    OOP principles

    CS FundamentalsRound 3 – TechnicalSource ↗
  63. 63

    Predict output of C code snippets

    Aptitude / MCQRound 3 – TechnicalSource ↗
  64. 64

    Design an LFU Cache

    LLD / Machine CodingRound 3 – Technical...Source ↗
  65. 65

    Filter e-commerce orders by COD vs prepaid at scale (write-heavy considerations)

    HLD / System DesignRound 3 – Technical...Source ↗
  66. 66

    Greedy problem (condition-based))

    DSA / CodingCodingSource ↗
  67. 67

    Comparator vs Comparable and usage)

    DSA / CodingCodingSource ↗
  68. 68

    What is used internally in TreeSet?)

    DSA / CodingCodingSource ↗
  69. 69

    Foreign key validation)

    DSA / CodingCodingSource ↗
  70. 70

    DP: position[] & weight[] – from i move +1 (cost weight[i]) or +2 (cost 0); min cost to reach last position)

    CS FundamentalsCodingSource ↗
  71. 71

    Singleton class – write code)

    CS FundamentalsCodingSource ↗
  72. 72

    OOPs code with implementation)

    CS FundamentalsCodingSource ↗
  73. 73

    Difference between WHERE and HAVING

    SQLRound not specifiedSource ↗
  74. 74

    Find the 5th highest salary in a table

    Technical / OtherRound not specifiedSource ↗
  75. 75

    Technologies you want to explore

    Technical / OtherRound not specifiedSource ↗
  76. 76

    Greedy / overlapping intervals)

    DSA / CodingTechnical InterviewSource ↗
  77. 77

    Remove adjacent duplicate characters in a string)

    DSA / CodingTechnical InterviewSource ↗
  78. 78

    Range 0–99 and K: find minimum Kth factor using binary search (+ time complexity))

    DSA / CodingTechnical InterviewSource ↗
  79. 79

    Introduction)

    DSA / CodingTechnical InterviewSource ↗
  80. 80

    Any questions for me?)

    DSA / CodingTechnical InterviewSource ↗
  81. 81

    2 problems on arrays & strings (brute force → optimise))

    DSA / CodingTechnical InterviewSource ↗
  82. 82

    2 DSA problems incl. Prefix Sum)

    DSA / CodingTechnical InterviewSource ↗
  83. 83

    OS: what is an OS, how it manages resources, scheduling algorithms)

    DSA / CodingTechnical InterviewSource ↗
  84. 84

    Cycle in undirected graph)

    DSA / CodingTechnical InterviewSource ↗
  85. 85

    Cycle in linked list)

    DSA / CodingTechnical InterviewSource ↗
  86. 86

    Banker's algorithm)

    DSA / CodingTechnical InterviewSource ↗
  87. 87

    Median of two sorted arrays without extra space)

    DSA / CodingTechnical InterviewSource ↗
  88. 88

    Self Join)

    SQLTechnical InterviewSource ↗
  89. 89

    Nth highest salary)

    SQLTechnical InterviewSource ↗
  90. 90

    3rd largest salary using a window function)

    SQLTechnical InterviewSource ↗
  91. 91

    Window functions & DENSE_RANK)

    SQLTechnical InterviewSource ↗
  92. 92

    What do we get if we decode a JSON Web Token (JWT)?)

    CS FundamentalsTechnical InterviewSource ↗
  93. 93

    DBMS: Normalization vs Denormalization)

    CS FundamentalsTechnical InterviewSource ↗
  94. 94

    Java/OOPs: Abstraction, Encapsulation)

    CS FundamentalsTechnical InterviewSource ↗
  95. 95

    Heap vs stack memory)

    CS FundamentalsTechnical InterviewSource ↗
  96. 96

    Paging)

    CS FundamentalsTechnical InterviewSource ↗
  97. 97

    Virtual DOM)

    CS FundamentalsTechnical InterviewSource ↗
  98. 98

    'D' in SOLID – Dependency Inversion vs Dependency Injection (write code))

    CS FundamentalsTechnical InterviewSource ↗
  99. 99

    Explain JWT and Joi validation (write JWT code))

    CS FundamentalsTechnical InterviewSource ↗
  100. 100

    Design patterns)

    LLD / Machine CodingTechnical InterviewSource ↗
  101. 101

    Design the REST API for your project)

    LLD / Machine CodingTechnical InterviewSource ↗
  102. 102

    Where did you use encapsulation in your project?)

    Project / ResumeTechnical InterviewSource ↗
  103. 103

    Explain your project)

    Project / ResumeTechnical InterviewSource ↗
  104. 104

    Architecture of your project)

    Project / ResumeTechnical InterviewSource ↗
  105. 105

    Situational DSA questions based on own project)

    HR / BehavioralTechnical InterviewSource ↗

Want these as a timed test for your batch?

12-week preparation plan

Twelve weeks to Infosys-ready.

12-15 h a week. Topics are ordered by how often Infosys asks them; the bar shows each topic's share of Infosys questions.

W1 W2 W3W4 W5 W6W7 W8 W9W10W11W12
1
Weeks 1-3Foundations
  • W1
    Arrays & Hashing22%
  • W2
    Two Pointers & Sliding Window7%Strings14%
  • W3
    Binary Search5%Linked List4%
2
Weeks 4-6Core data structures
  • W4
    Stack & Queue5%Heaps2%
  • W5
    Trees & BST5%
  • W6
    Graphs6%
3
Weeks 7-9DP, Greedy & Backtracking
  • W7
    Dynamic Programming13%
  • W8
    Dynamic Programming13%Greedy & Intervals5%
  • W9
    Backtracking2%Tries / Bit / Math9%
4
Week 10Company weak-spots
  • W10
    Top-weighted patterns22%
5
Week 11Infosys sprint
  • W11
    All DSA questions
6
Week 12Interview mode
  • W12
    Mock interviews
Want the week-by-week plan with problem lists? We send it to placement teams with the Infosys test.

How Board Infinity helps

Prepare your batch for Infosys, round by round.

Step 01Infosys-pattern test

Proctored, in the format of its rounds.

Step 02Batch gap report

Topic by topic, weighted to Infosys.

Step 03Preparation track

Mapped to these rounds.

Step 04Re-test before the drive

See who is ready, by name.

Free for colleges to start. One Infosys sample test per student email.
Next step

Prepare your students for Infosys.

A named member of our academic team replies within one working day.

  1. 1Tell us what you need
  2. 2We run a pre-assessment
  3. 3You get a gap analysis
  4. 4Then your proposal

Or write to connect@boardinfinity.com

Placement Intelligence

Request a proposal

Recruiter tests Request a proposal