Welcome to HackWithInfy 2025, the premier coding marathon designed to test your technical prowess and problem-solving skills. Whether you’re an aspiring software developer or a coding enthusiast, this hackathon is your gateway to exciting career opportunities with Infosys.
🚀 What is HackWithInfy?
HackWithInfy is an annual coding competition organized by Infosys, providing engineering students a platform to showcase their coding skills, develop impactful projects, and secure pre-placement opportunities. If you’re graduating in 2026, this is your chance to shine.
🎯 Key Highlights
- Eligibility: B.E./B.Tech/M.E./M.Tech/Dual Degree/MS (Research)/MCA/MSc (5 years integrated) students graduating in 2026.
- Registration Start Date: 6th February 2025
- Participation: Free of cost
- Event Rounds: 2 Rounds – Qualifier & Grand Finale
- Cash Prizes: Up to INR 3,00,000 for top performers
📅 Important Dates
- Registration Window: February – March 2025
- Qualifier Round: April 2025
- Grand Finale: August 2025
📝 How to Apply
- Step 1: Register Online
Complete your registration through the link provided by your college placement officer. Make sure to fill out the Infosys Survey Form accurately. (Check with your college, Infosys is reaching out to almost all the colleges) - Step 2: Qualifier Round
Participate in a 3-hour coding assessment on the Infosys Assessment Platform (IAP). - Step 3: Grand Finale
The top 100 coders will form teams and battle it out in a 4-day hackathon.
⚠️ Note: Ensure you register with a single HackWithInfy account to avoid disqualification.
There is no registration or apply link. Infosys approaches colleges for this. So check with your college placement officer. If they didn’t received any mail regarding this ask them to drop a mail to hackwithinfy@infosys.com from official TPO Mail.
🎁 Prizes & Opportunities
- 1st Prize: INR 3,00,000
- 2nd Prize: INR 1,50,000
- 3rd Prize: INR 1,00,000
Plus, Exclusive Career Perks:
- Pre-Placement Interviews (PPI) for roles like Specialist Programmer at Infosys.
- Global Internship Opportunities at Infosys campuses.
- Mentorship from Industry Experts.
- Chance to Work on Cutting-Edge Projects.
- Champion of Champions Award for the best individual performer.
📊 Event Structure
- Round 1: Qualifier (April 2025)
- Format: Individual participation
- Duration: 3 hours
- Criteria: Coding efficiency, test cases passed, and overall score
- Round 2: Grand Finale (August 2025)
- Format: Team-based hackathon (teams formed by Infosys)
- Duration: 4 days
- Judging Panel: Infosys leaders and industry experts
✔️ Eligibility Criteria
- Must be 18 years or older at the time of registration.
- Enrolled in a recognized Indian institution (except Infosys employees and their families).
- Graduation Year: 2026
- One account per participant is allowed.
⚠️ Important Rules & Guidelines
- Accurate Information: Incomplete or false information will lead to disqualification.
- Device Requirements: Finalists must have their own laptops and a stable internet connection.
- No Appeals: Infosys’ decisions regarding selection and prizes are final.
- Data Usage: By registering, participants consent to Infosys using their information for event-related purposes.
💡 Preparation Tips
- Practice Coding: Focus on data structures, algorithms, and problem-solving.
- Mock Tests: Attempt sample questions shared in the practice arena.
- Team Collaboration: For the grand finale, work on communication and teamwork skills.
How to prepare for HACKWITHINFY
Infosys Online Test #
Test Format
- Duration: 3 questions to be attempted in 3 hours.
- Cut-offs: Sectional and total cut-offs.
- Difficulty Levels:
- Easy: Basic aptitude, algorithms, and data structures.
- Medium: Based on Greedy algorithms.
- Hard: Involves Dynamic Programming.
- Languages: C/C++, Java, Python, or JavaScript.
How to Prepare
Medium Difficulty – Greedy Algorithms
- A Greedy algorithm makes the locally optimal choice at each stage.
- Types of Greedy Algorithms:
- Pure Greedy Algorithms
- Orthogonal Greedy Algorithms
- Relaxed Greedy Algorithms
Hard Difficulty – Dynamic Programming (DP)
- Principles:
- Break problems into subproblems and reuse calculated values.
- Avoid repeated work through memoization or tabulation.
- Characteristics:
- Overlapping Subproblems
- Optimal Substructure Properties
- Methods:
- Top-down with Memorization
- Bottom-up with Tabulation
- Examples:
- Knapsack Problem
- Fibonacci Numbers
- Palindromic Subsequence
- Longest Common Substring
- Dijkstra’s Algorithm
Infosys Virtual Interview #
Structure
- Duration: Approximately 1 hour
- Focus: Technical and behavioral assessment
- Content: Problem-solving using your preferred programming language
For CS/IT Students
- Algorithms
- Data Structures
- Automata Theory
- Compiler Design
- Computer Networks
- Operating Systems
- Digital Signal Processing (DSP)
- Object-Oriented Programming (OOP)
For Non-CS/IT Students
- Algorithms
- Data Structures
- Networks
- Digital Electronics
- DSP
- Mathematics
- OOP
- Control Systems
HackWithInfy Sample Questions #
- Gym Exercise Problem – Calculate the minimum exercises to reach exhaustion.
- Heroes vs. Villains – Determine the minimum villains to remove for heroes to win.
- Rugged Terrain Road Construction – Find the minimum days needed to make the terrain strictly downward sloping.
- Transform Array into a Mountain – Determine the minimum elements to change to form a mountain.
- Interesting String Division – Maximize the number of equal contiguous pieces.
- Lexicographical Array Swap – Find the smallest lexicographical array possible after at most one swap within a distance K.
🤔 FAQs
Q1: Is there any registration fee?
A: No, participation is completely free.
Q2: Can students from any stream participate?
A: Only engineering and related technical streams are eligible.
Q3: How do I prepare for HackWithInfy?
A: Utilize the practice arena, work on problem-solving, and brush up on your coding skills.
