Campus / off-campus System Engineer & System...
Campus: Aug-Feb, off-campus: rolling
- 1Online test
- 2Technical interview
- 3HR interview
Recruiter guide · IT Services (Mass + Premium)
3 rounds, 3.6 LPA, and exactly what each round tests. Built from public hiring data and reported interview questions.
Company snapshot
HackWithInfy (coding contest → PPI for SP/DSE), InfyTQ / campus drives, off-campus drive for 2025 grads (announced Oct 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)
12,000 freshers hired H1 FY26, target 20,000 FY26
HackWithInfy runs annually (registrations ~Mar-May for pre-final years)
Routes in
Each route, the role and package it leads to, and its steps.
Campus: Aug-Feb, off-campus: rolling
Several windows a year (off-campus, e.g.
Registration ~Mar-May, rounds Jun-Aug
Discontinued (last ~2023)
Applications rolling (summer & winter cohorts)
The hiring process
Every round in order: what happens, what was asked, and how to clear it.
Tip Secure partial scores on all 3; use C++/Java for speed; write brute force for Q3 to get partial test cases.
Tip Revise your own assessment code; have 1-2 strong projects.
Standard HR + documents, relocation, Mysuru training
Tip Say yes to relocation and technology flexibility.
What gets tested
How to prepare
Interview questions
From candidate reports, 2024-26. Filter by type.
Count subsets with XOR equal to K (bitmask DP)
DSA / CodingCoding AssessmentMinimum cost to make all tree nodes equal (tree DP)
DSA / CodingCoding AssessmentShortest path with at most K edges (modified Dijkstra/Bellman-Ford)
DSA / CodingCoding AssessmentHouse Robber variant (LC 198)
DSA / CodingCoding AssessmentMinimum cost to make tree nodes equal (tree DP)
DSA / CodingCoding AssessmentShortest path with at most K edges (LC 787 style)
DSA / CodingCoding AssessmentReverse a string / check palindrome
DSA / CodingCoding AssessmentSecond largest element in an array
DSA / CodingCoding AssessmentMaximize sum choosing elements with constraint on adjacent indices (DP)
Puzzle / ProbabilityCoding AssessmentGreedy problem (medium)
DSA / CodingRound 1 – HackWithInfySource ↗DP problem (hard)
DSA / CodingRound 1 – HackWithInfySource ↗Coin-change-like problem (easy)
Technical / OtherRound 1 – HackWithInfySource ↗Fibonacci series without using a temporary variable
DSA / CodingRound 1 – HackWithInfy OASource ↗ArrayList-related problem
DSA / CodingRound 1 – HackWithInfy OASource ↗Exception handling coding problem
DSA / CodingRound 1 – HackWithInfy OASource ↗Bulbs toggle problem – bit manipulation (alternating bits)
DSA / CodingRound 1 – OASource ↗Count warships (Number of Islands variant) via DFS
DSA / CodingRound 1 – OASource ↗Segment tree problem (~CF 1700-1800)
DSA / CodingRound 1 – OASource ↗Tree traversal DFS/BFS
DSA / CodingRound 1 – OASource ↗Ad-hoc problem with key observation – cache last index visited (~CF 1600)
CS FundamentalsRound 1 – OASource ↗Recursion – explore all combinations
HR / BehavioralRound 1 – OASource ↗Variations of Fibonacci, LIS, LCS (other candidates)
DSA / CodingRound 1 – Offline codingSource ↗Rate limiting to prevent API abuse)
CS FundamentalsRound 1 – System DesignSource ↗URL shortener: 1M DAU, 1:10000 write:read, multi-region low latency)
HLD / System DesignRound 1 – System DesignSource ↗Caching to reduce DB access)
Technical / OtherRound 1 – System DesignSource ↗Diagnose inconsistent per-user latency)
Technical / OtherRound 1 – System DesignSource ↗Climbing Stairs
DSA / CodingRound 2 – Basic DSA/CSSource ↗Swap two numbers without a third variable
DSA / CodingRound 2 – Basic DSA/CSSource ↗Merge Sort
DSA / CodingRound 2 – Basic DSA/CSSource ↗Deadlock prevention and handling
CS FundamentalsRound 2 – On-site...Source ↗Inheritance, polymorphism, encapsulation
CS FundamentalsRound 2 – On-site...Source ↗Career aspirations
Aptitude / MCQRound 2 – On-site...Source ↗Machine learning and ReactJS key terms
Technical / OtherRound 2 – On-site...Source ↗Quick Sort)
DSA / CodingRound 2 – TechnicalSource ↗Abstraction
CS FundamentalsRound 2 – Video interviewSource ↗Inheritance – types, multiple, multilevel
CS FundamentalsRound 2 – Video interviewSource ↗What is indexing?
CS FundamentalsRound 2 – Video interviewSource ↗ACID properties
CS FundamentalsRound 2 – Video interviewSource ↗Delete Operation for Two Strings (LeetCode 583)
Aptitude / MCQRound 2 – Video interviewSource ↗What are views?
HR / BehavioralRound 2 – Video interviewSource ↗What is a trigger?
HR / BehavioralRound 2 – Video interviewSource ↗Explain your assessment solution and its complexity
DSA / CodingTechnical InterviewHashMap internals and collision handling
DSA / CodingTechnical InterviewWrite SQL for second highest salary
SQLTechnical InterviewSecond highest salary
SQLTechnical InterviewJoins between employee and department
SQLTechnical InterviewGROUP BY with HAVING
SQLTechnical InterviewProcess vs thread; deadlock prevention
CS FundamentalsTechnical InterviewAbstract class vs interface
CS FundamentalsTechnical InterviewFour pillars of OOP
CS FundamentalsTechnical InterviewNormalization 1NF-3NF
CS FundamentalsTechnical InterviewHow would your project scale to 10x users?
HLD / System DesignTechnical InterviewWhy Infosys?
HR / BehavioralHRWilling to relocate and work on any technology?
HR / BehavioralHRWhat do you know about Infosys Springboard?
HR / BehavioralHRAny backlogs or gaps?
HR / BehavioralHROOP basics
CS FundamentalsRound 3 – HRSource ↗Rate yourself out of 5 on each resume skill
Project / ResumeRound 3 – HRSource ↗HTML/CSS basics
HR / BehavioralRound 3 – HRSource ↗ER diagrams
DSA / CodingRound 3 – TechnicalSource ↗Advantages and disadvantages of AI
DSA / CodingRound 3 – TechnicalSource ↗OOP principles
CS FundamentalsRound 3 – TechnicalSource ↗Predict output of C code snippets
Aptitude / MCQRound 3 – TechnicalSource ↗Design an LFU Cache
LLD / Machine CodingRound 3 – Technical...Source ↗Filter e-commerce orders by COD vs prepaid at scale (write-heavy considerations)
HLD / System DesignRound 3 – Technical...Source ↗Greedy problem (condition-based))
DSA / CodingCodingSource ↗Comparator vs Comparable and usage)
DSA / CodingCodingSource ↗What is used internally in TreeSet?)
DSA / CodingCodingSource ↗Foreign key validation)
DSA / CodingCodingSource ↗DP: position[] & weight[] – from i move +1 (cost weight[i]) or +2 (cost 0); min cost to reach last position)
CS FundamentalsCodingSource ↗Singleton class – write code)
CS FundamentalsCodingSource ↗OOPs code with implementation)
CS FundamentalsCodingSource ↗Difference between WHERE and HAVING
SQLRound not specifiedSource ↗Find the 5th highest salary in a table
Technical / OtherRound not specifiedSource ↗Technologies you want to explore
Technical / OtherRound not specifiedSource ↗Greedy / overlapping intervals)
DSA / CodingTechnical InterviewSource ↗Remove adjacent duplicate characters in a string)
DSA / CodingTechnical InterviewSource ↗Range 0–99 and K: find minimum Kth factor using binary search (+ time complexity))
DSA / CodingTechnical InterviewSource ↗Introduction)
DSA / CodingTechnical InterviewSource ↗Any questions for me?)
DSA / CodingTechnical InterviewSource ↗2 problems on arrays & strings (brute force → optimise))
DSA / CodingTechnical InterviewSource ↗2 DSA problems incl. Prefix Sum)
DSA / CodingTechnical InterviewSource ↗OS: what is an OS, how it manages resources, scheduling algorithms)
DSA / CodingTechnical InterviewSource ↗Cycle in undirected graph)
DSA / CodingTechnical InterviewSource ↗Cycle in linked list)
DSA / CodingTechnical InterviewSource ↗Banker's algorithm)
DSA / CodingTechnical InterviewSource ↗Median of two sorted arrays without extra space)
DSA / CodingTechnical InterviewSource ↗Self Join)
SQLTechnical InterviewSource ↗Nth highest salary)
SQLTechnical InterviewSource ↗3rd largest salary using a window function)
SQLTechnical InterviewSource ↗Window functions & DENSE_RANK)
SQLTechnical InterviewSource ↗What do we get if we decode a JSON Web Token (JWT)?)
CS FundamentalsTechnical InterviewSource ↗DBMS: Normalization vs Denormalization)
CS FundamentalsTechnical InterviewSource ↗Java/OOPs: Abstraction, Encapsulation)
CS FundamentalsTechnical InterviewSource ↗Heap vs stack memory)
CS FundamentalsTechnical InterviewSource ↗Paging)
CS FundamentalsTechnical InterviewSource ↗Virtual DOM)
CS FundamentalsTechnical InterviewSource ↗'D' in SOLID – Dependency Inversion vs Dependency Injection (write code))
CS FundamentalsTechnical InterviewSource ↗Explain JWT and Joi validation (write JWT code))
CS FundamentalsTechnical InterviewSource ↗Design patterns)
LLD / Machine CodingTechnical InterviewSource ↗Design the REST API for your project)
LLD / Machine CodingTechnical InterviewSource ↗Where did you use encapsulation in your project?)
Project / ResumeTechnical InterviewSource ↗Explain your project)
Project / ResumeTechnical InterviewSource ↗Architecture of your project)
Project / ResumeTechnical InterviewSource ↗Situational DSA questions based on own project)
HR / BehavioralTechnical InterviewSource ↗Want these as a timed test for your batch?
12-week preparation plan
12-15 h a week. Topics are ordered by how often Infosys asks them; the bar shows each topic's share of Infosys questions.
How Board Infinity helps
Proctored, in the format of its rounds.
Topic by topic, weighted to Infosys.
Mapped to these rounds.
See who is ready, by name.
A named member of our academic team replies within one working day.
We compile company careers pages, company press releases and results, published job-market reports from job portals, staffing firms and industry bodies, and accounts that candidates have shared publicly. Headline growth figures are averages across several independent reports. Each figure links to its source.
Company names, logos, test names (such as TCS NQT and HackWithInfy) and product names are trademarks of their respective owners. We use them only to identify the companies and hiring processes we describe.
Board Infinity is not affiliated with, sponsored by or endorsed by the companies listed. Our free tests are original practice assessments built on publicly reported formats. They are not official company tests and do not lead to a job offer.
Hiring processes, dates and intake plans change every season. Information is as of the date shown and may be incomplete. Always confirm dates and eligibility on the company's official careers page before applying.
Links to other websites are for reference. We do not control their content, and their terms and privacy policies apply.
We collect the details you submit only to send what you asked for and to follow up about it, with your consent, in line with India's Digital Personal Data Protection Act, 2023. You can ask us to correct or delete your data, or withdraw consent, at connect@boardinfinity.com. Our full Privacy Policy and Terms apply.
If you represent a company and want information corrected or removed, write to connect@boardinfinity.com and we will review it promptly.
The analysis, summaries, readiness plans and page design are © 2026 Board Infinity (Learnture Ventures Pvt. Ltd.). Short quotes with a link back are welcome; please do not copy the data in bulk.