What is the salary package for Infosys HackWithInfy 2026?

Infosys HackWithInfy 2026 offers multiple tiers: Systems Engineer at ₹3.6–4.0 LPA, Digital Specialist Engineer (DSE) at ₹6.25 LPA, Specialist Programmer (SP) at ₹9.5–11.0 LPA, Power Programmer (PP) at ₹10.0–12.0 LPA, and SP Level 1/Level 2 (Grand Finale Champions) at ₹16.0–21.0 LPA.

How many rounds are there in Infosys HackWithInfy?

HackWithInfy has 3 rounds: Round 1 is a 3-hour Online Assessment with MCQs and 3 coding questions (Easy, Medium, Hard). Round 2 is a 3-hour Advanced Online Round on the Infosys Assessment Platform (IAP) focusing on Greedy Algorithms and Dynamic Programming, selecting the National Top 100. Round 3 is a 4-day Grand Finale hackathon at the Infosys campus with team-based challenges and one-to-one technical interviews.

What is the eligibility criteria for Infosys HackWithInfy 2026?

HackWithInfy is open to final-year engineering and science graduates. Candidates need a functional webcam, i3 Core or higher processor, 4GB RAM, stable internet (2 Mbps down / 1 Mbps up), and Google Chrome 70+. Supported coding languages include C, C++, Python, Java, JavaScript, TypeScript, and Go.

What topics should I prepare for Infosys HackWithInfy?

For the Specialist Programmer track, focus on Arrays, Strings, Advanced Recursion, Bit Mapping, Stacks, Queues, Trees (BST, Morris Traversal), Graphs (Dijkstra's, Bellman-Ford), Dynamic Programming (Digit DP, DP on Trees), Greedy Algorithms, and Backtracking. Hard problems require Segment Trees and Sparse Tables.

How long does it take to prepare for Infosys HackWithInfy?

The recommended preparation timeline is 8–9 months: Months 1–3 for foundational mastery (Arrays, Strings, ~150 Easy problems), Months 4–6 for advanced optimization (Trees, Graphs, DP — targeting the SP track), and Months 7–9 for competitive programming (Codeforces Specialist 1400+ rating, LeetCode Knight 1800+ rating).

Tools

Back to Aptitude Simulator

Infosys HackWithInfy 2026 Strategic Framework

Elite coding competition pathway to Specialist Programmer roles (₹9.5-21 LPA)

3 Rounds

Elite Selection

Top 100

Grand Finale

₹21L

Max Package

8-9 Months

Prep Timeline

18 min read

2026 Pattern

For Freshers?

Challenging for freshers

Difficulty Level

Very Hard

Prep Time

8-9 months

Negative Marking

Last updated: February 25, 2026

Report an error

Strategic Intent: Elite Talent Identification

The Olympics of Coding - Bypassing traditional metrics for pure algorithmic mastery

HackWithInfy serves as Infosys's premier National-Level Coding Competition and "Elite Selection" mechanism. This tiered recruitment framework optimizes organizational human capital by securing the top 5% of technical talent while maintaining a robust baseline through Systems Engineer mass hiring.

Primary Objectives

Elite Talent Identification: "Champions of Champions"
Direct Pipeline to High-Compensation Roles (SP, PP, DSE)
Innovation Stress-Testing under pressure
Institutional Brand Equity positioning

Key Differentiators

Pure algorithmic mastery over aptitude tests
Specialist Programmers with advanced problem-solving
Reduces long-term training costs and technical debt
Immediate professional status for excellence

The Three-Round Evaluation Lifecycle

Round 1: Online Assessment

Duration: 3 Hours

Format: MCQs + 3 Coding Questions

Difficulty: Easy, Medium, Hard

Languages: C, C++, Python, Java, JavaScript, TypeScript, Go

Gateway: Solving all 3 questions → Power Programmer track

Primary weight on coding questions. MCQs serve as baseline assessment.

Round 2: Advanced Online Round

Duration: 3 Hours

Platform: Infosys Assessment Platform (IAP)

Focus: Greedy Algorithms & Dynamic Programming

Difficulty: Higher complexity

Selection: National Top 100

Brute-force logic insufficient. Optimal time/space complexity required.

Round 3: Grand Finale

Duration: 4 Days

Location: Infosys Campus

Format: Team-based Hackathon

Focus: Real-world application & innovation

Final Stage: One-to-one technical interviews

Shift from individual logic to team-based innovation with senior engineering leads.

Professional Hierarchy: Roles & Compensation

Role Title	Package (LPA)	Primary Focus	Selection Pathway
Systems Engineer (SE)	₹3.6 - 4.0	Aptitude, Verbal, Basic Pseudo-code	Infosys NQT / Mass Hiring
Digital Specialist Engineer (DSE)	₹6.25	Web Dev + Medium DSA Efficiency	Coding Assessment + Interview
Specialist Programmer (SP)	₹9.5 - 11.0	Hard DSA (80%) + Competitive Programming	3 Questions Solved (HWI)
Power Programmer (PP)	₹10.0 - 12.0	Advanced DSA + Complex Problem Solving	HWI Round 2/3 Top Performers
SP Level 1 / Level 2	₹16.0 - 21.0	Elite Competitive Programming & Innovation	Grand Finale "Champions"

Fallback Strategy

Candidates who fail Power Programmer (PP) interviews are systematically offered System Engineer Specialist (SES) roles. This cascading structure ensures "70% FAANG-ready" talent isn't lost to competitors.

Technical Competency Mapping & Syllabus

Foundational Logic

Array & String Manipulation
Advanced Recursion
Bit Mapping/Hashing
Mapping Concepts

Advanced Data Structures

Stacks & Queues
Trees (BST, Morris Traversal)
Graphs (Dijkstra's, Bellman-Ford)
Heap & Union-Find

Algorithmic Optimization

Dynamic Programming (Digit DP)
DP on Trees
Greedy Algorithms
Backtracking & Divide-Conquer

Problem Difficulty Distribution

Easy/Medium Tiers

Focus: Logical Simulation

• "Oil Tank" capacity problems
• "General Ali's" soldier reduction game
• Base logic and simulation testing

Hard/Very Hard Tiers

Focus: Algorithmic Optimization

• "Graph Beauty Ranges"
• "Bitwise XOR Subset Amazement"
• Segment Trees, Sparse Tables required

System Requirements & Integrity Protocols

Hardware Requirements

i3 Core or higher processor
4GB RAM minimum
Functional webcam (mandatory)
Stable Internet: 2 Mbps down / 1 Mbps up

Software Requirements

Google Chrome 70+ (latest version)
Pop-up blocker disabled
System check: rec-test.infosys.com/precheck

Absolute Integrity Checklist - Violations Lead to Disqualification

❌ Zero-Device Policy: No calculators, headphones, earphones
❌ Communication Lockdown: No Skype, Teams, external apps
❌ Physical Monitoring: Must stay in video frame
❌ No other persons in room during test

❌ Window Tracking: No switching away from test screen
❌ Webcam must capture full, clear face at all times
⏰ 15-Minute Login Rule: Login within first 15 mins of slot
⚠️ Missing login window = Automatic forfeiture

8-9 Month Strategic Preparation Roadmap

Months 1-3

Foundational Mastery

• C++ STL / Java Collections
• Arrays, Strings, Basic Recursion
• Solve ~150 Easy problems
• Build strong base logic

Months 4-6

Advanced Optimization

• Trees, Graphs, Dynamic Programming
• Master 80-100 DP patterns
• Threshold for SP track
• Focus on time complexity

Months 7-9

Competitive Programming

• Timed sprints on Codeforces
• Specialist 1400+ rating target
• LeetCode Knight 1800+ rating
• Mock contests & upsolving

Daily Schedule (6-8 Hours Intensity)

Morning (3 hrs):

Deep dive into new patterns (DP with Bitmask, Segment Trees)

Afternoon (3 hrs):

Solve 5-6 Hard/Medium problems, focus on time complexity

Evening (1-2 hrs):

Mock contests and upsolving missed problems

Night (30 mins):

Quick review of CS Fundamentals (OOP, DBMS, OS)

Annual Recruitment Lifecycle

August

Pre-placement webinars and registration

September - October

Online test windows (NQT and HackWithInfy)

October - November

Technical and HR interview cycles

November - December

Offer rollout and PPO confirmations

March - June

Additional off-campus opportunities

July

Joining window for the new cohort

Commonly Asked Coding Questions in Round 2

Round 2 (Advanced Online Round) is where most candidates are eliminated. These are the problem patterns that appear most frequently, sourced from HackWithInfy participants across multiple years.

1. Maximum Subarray Sum with at most K Distinct Elements

Hard

Given an array of integers, find the maximum sum of a contiguous subarray that contains at most K distinct elements. Requires Sliding Window + HashMap combination.

Sliding WindowHashMapTwo Pointers

2. Minimum Cost to Connect All Cities (MST Variant)

Hard

Given N cities and weighted edges, find the minimum cost to connect all cities. Some cities may already be connected. Classic Kruskal's or Prim's algorithm with Union-Find.

Minimum Spanning TreeUnion-FindGreedy

3. Longest Increasing Subsequence with Constraints

Medium-Hard

Find the length of the longest strictly increasing subsequence where the difference between consecutive elements is at most D. Requires DP with Binary Search (patience sorting) for O(N log N) solution.

Dynamic ProgrammingBinary SearchLIS Pattern

4. Count Paths in Grid with Obstacles (DP on Grid)

Medium-Hard

Count the number of unique paths from top-left to bottom-right in an M×N grid with blocked cells. Extended variant includes collecting maximum coins along the path.

2D DPGrid TraversalMemoization

5. Bitwise XOR Subset Sum (Bitmask DP)

Hard

Given an array, find the number of subsets whose XOR equals a target value K. Requires Bitmask DP or meet-in-the-middle approach for large inputs. This is the "Bitwise XOR Subset Amazement" problem type referenced in HWI editorials.

Bitmask DPXOR PropertiesMeet in the Middle

6. Shortest Path in Weighted Graph with Negative Edges

Hard

Find the shortest path between two nodes in a directed graph that may contain negative weight edges (but no negative cycles). Bellman-Ford algorithm required; Dijkstra's alone is insufficient.

Bellman-FordGraph Shortest PathNegative Weights

Round 2 Strategy

Brute-force solutions will not pass Round 2. Every problem requires an optimal time complexity solution — typically O(N log N) or better. Focus your prep on Greedy + DP combinations and Graph algorithms (Dijkstra's, Bellman-Ford, MST). Aim to solve at least 2 of 3 problems completely to advance to the Grand Finale.

Start HackWithInfy Practice Now

🏢