Infosys Off Campus 2026
Infosys Off Campus 2026 — Complete Guide
Last Updated: March 2026
Infosys Off Campus recruitment is a golden opportunity for fresh graduates who missed their on-campus placements or want to apply directly. Infosys conducts off-campus drives throughout the year through various channels.
Infosys Off Campus Overview
| Aspect | Details |
|---|---|
| Target Audience | Fresh graduates (2024, 2025, 2026 batches) |
| Modes | HackWithInfy, InfyTQ, Direct Off Campus |
| Frequency | Year-round |
| Location | Pan India (Test centers/Online) |
| Registration | Online through Infosys career portal |
Eligibility Criteria
Academic Requirements
- Degree: BE/B.Tech/ME/M.Tech/MCA/M.Sc (CS/IT/ECE/EEE and related branches)
- Percentage: Minimum 60% or 6.0 CGPA in 10th, 12th, and Graduation
- Backlogs: No active backlogs at the time of application
- Gap: Maximum 2 years gap between academics (varies by drive)
Additional Requirements
- Full-time courses only
- Valid email ID and phone number
- Good communication skills
- Basic programming knowledge
Types of Infosys Off Campus Drives
1. HackWithInfy
- Type: Coding competition
- Prizes: Job offers + cash prizes
- Format: Online coding rounds
- Levels: Round 1 (Online), Round 2 (Online/Offline), Grand Finale
2. InfyTQ (Infosys Talent Quotient)
- Type: Certification + recruitment
- Benefit: Certificate valid across industry
- Format: Online assessment
- Validity: Score valid for multiple drives
3. Direct Off Campus
- Type: Direct hiring drives
- Frequency: Monthly/Quarterly
- Process: Similar to on-campus
4. Power Programmer/SE Role
- Type: Specialized hiring
- Package: Higher than standard role
- Requirements: Strong coding skills
Infosys Off Campus Exam Pattern
Standard Pattern:
| Section | Questions | Duration | Difficulty |
|---|---|---|---|
| Reasoning Ability | 15 | 25 min | Moderate |
| Technical Ability | 10 | 35 min | Moderate-Hard |
| Verbal Ability | 20 | 20 min | Easy-Moderate |
| Mathematical Ability | 10 | 35 min | Moderate |
| Pseudocode | 5 | 10 min | Moderate |
| Puzzle Solving | 4 | 10 min | Hard |
| Total | 64 | 135 min | - |
HackWithInfy Pattern:
| Round | Type | Duration | Questions |
|---|---|---|---|
| Round 1 | Online Coding | 3 hours | 3 coding problems |
| Round 2 | Online/Offline | 3 hours | 3 coding problems |
| Grand Finale | Offline | 1 day | Multiple rounds |
15 Sample Questions for Off Campus
Reasoning Ability (Questions 1-4)
Q1. If the word 'CODING' is coded as 'DPEJOH', how is 'PYTHON' coded?
- a) QZUIPQ
- b) QZUIOP
- c) QZUIPO
- d) QZVIPO
Q2. Statements: All boys are students. Some students are girls. No girl is a teacher. Conclusions: I. Some boys are teachers II. No student is a teacher
- a) Only I follows
- b) Only II follows
- c) Both follow
- d) Neither follows
Q3. What comes next: 2, 6, 12, 20, 30, 42, ?
- a) 54
- b) 56
- c) 58
- d) 60
Q4. Pointing to a woman, a man said, "Her mother is the only daughter of my mother." How is the man related to the woman?
- a) Father
- b) Brother
- c) Uncle
- d) Maternal Uncle
Mathematical Ability (Questions 5-8)
Q5. The average of 5 consecutive numbers is 21. What is the largest number?
- a) 21
- b) 22
- c) 23
- d) 24
Solution: Numbers: 19, 20, 21, 22, 23. Largest = 23.
Q6. A shopkeeper sells an item at a loss of 10%. If he had sold it for ₹90 more, he would have gained 5%. Find the cost price.
- a) ₹500
- b) ₹600
- c) ₹700
- d) ₹800
Solution: Let CP = x. 0.9x + 90 = 1.05x. 0.15x = 90. x = 600.
Q7. How many 3-digit numbers are divisible by 7?
- a) 128
- b) 129
- c) 130
- d) 131
Solution: First 3-digit number divisible by 7: 105. Last: 994. Count = (994-105)/7 + 1 = 128.
Q8. A train 200m long crosses a bridge 300m long in 25 seconds. What is the speed of the train?
- a) 60 km/hr
- b) 70 km/hr
- c) 72 km/hr
- d) 80 km/hr
Solution: Total distance = 500m. Speed = 500/25 = 20 m/s = 72 km/hr.
Technical Ability (Questions 9-11)
Q9. Which sorting algorithm has the best average-case time complexity?
- a) Bubble Sort
- b) Insertion Sort
- c) Quick Sort
- d) Merge Sort
Q10. In SQL, which command is used to add a new column to an existing table?
- a) ADD COLUMN
- b) MODIFY COLUMN
- c) ALTER TABLE
- d) UPDATE TABLE
Q11. What is the output of the following code?
int x = 5;
printf("%d", x++ * ++x);
- a) 25
- b) 30
- c) 35
- d) Undefined
Explanation: Modifying the same variable multiple times between sequence points leads to undefined behavior.
Verbal Ability (Questions 12-13)
Q12. Choose the word closest in meaning to "Pernicious":
- a) Beneficial
- b) Harmful
- c) Innocuous
- d) Advantageous
Q13. Fill in the blank: The committee ______ submitted its report.
- a) have
- b) has
- c) are
- d) were
Pseudocode (Questions 14-15)
Q14. What is the output of the following pseudocode?
integer n = 5, i, fact = 1
for i from 1 to n:
fact = fact * i
end for
print fact
- a) 24
- b) 120
- c) 720
- d) 100
Q15. What does this pseudocode calculate?
integer a = 10, b = 20
temp = a
a = b
b = temp
print a, b
- a) Sum of a and b
- b) Swaps values of a and b
- c) Product of a and b
- d) Difference of a and b
HackWithInfy Preparation
What is HackWithInfy?
HackWithInfy is Infosys's premier coding competition that serves as a recruitment platform for top programming talent.
Competition Structure
| Stage | Details | Rewards |
|---|---|---|
| Round 1 | Online coding (3 questions) | Top performers qualify |
| Round 2 | Online/onsite coding | Job offers for top 100 |
| Grand Finale | National finals | Cash prizes + PPIs |
Sample HackWithInfy Problems
Problem 1: Given an array of integers, find the maximum sum of a subarray with the constraint that no two elements are adjacent.
Problem 2: Given a binary tree, find the maximum path sum between any two nodes.
Problem 3: Implement an LRU (Least Recently Used) cache with O(1) operations.
InfyTQ Certification
Benefits of InfyTQ
- Industry-recognized certification
- Direct interview opportunities
- Valid for multiple drives
- Higher package potential
Exam Pattern
| Section | Questions | Duration |
|---|---|---|
| Aptitude | 20 | 30 min |
| Technical MCQs | 15 | 25 min |
| Coding | 2 | 45 min |
Important Tips for Infosys Off Campus
Registration Tips
- Early Registration: Apply as soon as drives open
- Accurate Information: Double-check all details
- Professional Email: Use a formal email address
- Updated Resume: Highlight projects and skills
- Photo: Upload professional photograph
Preparation Strategy
- Daily Practice: Solve 20-30 aptitude questions
- Coding Practice: Code daily for at least 1 hour
- Mock Tests: Attempt weekly mock tests
- Previous Papers: Solve last 5 years' papers
- Technical Revision: Revise CS fundamentals
Exam Day Tips
- System Check: Test your system before online exams
- Internet: Ensure stable connection
- Time Management: Don't spend too long on one question
- Rough Work: Use scratch paper for calculations
- Review: Check answers if time permits
Frequently Asked Questions (FAQs)
Q1. Can I apply for Infosys off campus if I was rejected in on-campus? A: Generally, you need to wait for 6 months to 1 year before reapplying.
Q2. What is the best way to prepare for HackWithInfy? A: Practice competitive programming on CodeChef, HackerRank, and LeetCode.
Q3. Is InfyTQ mandatory for Infosys off campus? A: No, but it gives you an advantage and valid certification.
Q4. How long are InfyTQ scores valid? A: Typically 1-2 years, but check official guidelines.
Q5. Can I participate in HackWithInfy multiple times? A: Yes, you can participate in different editions.
Registration Process
Step-by-Step Guide:
-
Visit Career Portal
- Go to: careers.infosys.com
- Click on "Fresher" section
-
Create Account
- Register with email
- Verify through OTP
-
Complete Profile
- Academic details
- Personal information
- Upload documents
-
Search Drives
- Filter by "Off Campus"
- Check eligibility
- Apply for suitable drives
-
Track Application
- Login regularly
- Check email for updates
- Download hall ticket
Important Resources
All the best for your Infosys Off Campus preparation! 🚀
Explore this topic cluster
More resources in Company Placement Papers
Use the category hub to browse similar questions, exam patterns, salary guides, and preparation resources related to this topic.