Infosys HackWithInfy 2026: Kaise Crack Kare

JobRise Team4 मार्च 20266 min read

HackWithInfy = Infosys ka national-level coding contest. Top performers ko ₹10-12 LPA "System Engineer Specialist" (SES) ya "Power Programmer" role milta hai.

Average Infosys SE role ₹3.6 LPA, but HWI champions ka 3x. Worth the effort.

HackWithInfy 2026 overview#

Eligibility:

B.E./B.Tech/MCA students
Pre-final and final year
All branches eligible
60% minimum throughout (10th, 12th, current)

Format:

Round 1: Online qualifier

3 coding problems
3 hours
HackerRank platform
Easy, medium, hard

Round 2: Grand finale (Top 100)

Onsite at Infosys campus
More complex problems
6 hours
Live coding + algo

Prizes:

Winner: ₹2.5 lakh + Power Programmer role (₹11 LPA)
Runner-up: ₹1.5 lakh + SES role (₹8 LPA)
2nd Runner-up: ₹1 lakh + SES role
Top 100: Pre-placement offer (PPO) + SES role

Agla guide email par pao

Naye guides aur fresh jobs, ek chhote email mein. Free.

Skill level required#

HWI is harder than TCS NQT. Required:

Algorithms:

Dynamic programming (heavy)
Graph algorithms (BFS, DFS, Dijkstra)
Greedy algorithms
Divide and conquer
Backtracking

Data structures:

Arrays, strings (advanced)
Linked lists
Stacks, queues, deques
Trees (BST, segment, fenwick)
Heaps
Hash tables
Tries
Disjoint set union

Math:

Number theory
Combinatorics
Probability
Modular arithmetic

LeetCode rating 1500+ recommended. CodeChef 3-star or above.

90-day preparation plan#

Phase 1 (Day 1-30): Foundation

Daily routine:

2 hours theory (DSA fundamentals)
2 hours problem solving (LeetCode easy + medium)
30 min reading editorial solutions

Topics:

Arrays + 2 pointers
Hash maps
Strings
Linked lists
Recursion basics
Binary search

Target: 100 LeetCode problems solved (mostly easy + medium)

Phase 2 (Day 31-60): Intermediate

Daily routine:

3 hours coding
1 hour algorithm reading

Topics:

Trees (traversals, BST, LCA)
Graphs (BFS, DFS, shortest path)
Dynamic programming basics
Greedy algorithms
Backtracking

Target: 200 problems total. Mix of medium + few hard.

Phase 3 (Day 61-90): Contest prep

Daily routine:

1 LeetCode contest weekly
1 CodeForces contest weekly
Past HWI problems daily
Mock tests

Topics:

Advanced DP
Segment trees
Game theory
Bit manipulation
Number theory

Target: 300+ problems, 80% medium, 20% hard

Best resources#

Practice platforms:

LeetCode (must)
CodeForces (contest practice)
HackerRank (Infosys-style problems)
GeeksforGeeks (theory)
AtCoder (Japanese problems)

Topic-wise tracks:

Striver's A2Z DSA sheet
Love Babbar 450 questions
NeetCode 150
Apna College DSA sheet

Past papers:

HackerRank "Infosys HackWithInfy" tag
HWI 2023, 2024 past problems on Indiabix
LeetCode + GFG companies tag

YouTube:

Striver (DSA)
Aditya Verma (DP)
Tushar Roy (problem solving)
William Lin (competitive programming)
Errichto (advanced)

Question types#

Round 1 typical questions:

Easy (1 question):

Array manipulation
String operations
Basic math
Time: 30-45 min

Medium (1 question):

DP basic
Graph problem (BFS/DFS)
Tree operations
Time: 60-75 min

Hard (1 question):

Advanced DP
Segment trees
Complex graph
Time: 90-120 min

Round 2 (finale) typical:

4-6 problems
Mix of medium and hard
Some require novel approach
Time pressure intense

Day-of strategy#

Round 1 (3 hours, 3 problems):

Hour 1:

All 3 problems read karo
Easy solve karo first (45 min)
Medium try karo

Hour 2:

Medium solve karo
Test cases edge case wala

Hour 3:

Hard problem
Best attempt
Partial points bhi count hote hai

Strategy:

Submit something for all 3 (even partial)
Test cases all run karo
Code clean rakho

Coding tips#

Language choice:

C++ (most competitive, STL benefits)
Python (less verbose, but slower)
Java (balanced)

Most HWI top performers use C++.

Time complexity awareness:

10^6 operations: 1 second
10^7 operations: 1-2 seconds
10^8 operations: 5-10 seconds (TLE risk)

Common mistakes:

Integer overflow (use long long)
Off-by-one errors
Edge cases missed (empty array, single element)
Wrong I/O format

Template usage:

C++ template ready rakho:

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    // your code here
    return 0;
}

Speed advantage in real contest.

Past HWI patterns#

Common problem types seen:

Array manipulation with constraints
- Find subarray with given sum
- Maximum sum subarray (Kadane's)
- Sliding window problems
String problems
- Longest palindromic substring
- String matching (KMP, Z-algorithm)
- Anagram problems
Tree problems
- Lowest common ancestor
- Tree diameter
- Path sum variations
Graph problems
- Connected components
- Cycle detection
- Shortest path variations
Dynamic programming
- Longest common subsequence
- Knapsack variations
- Matrix chain multiplication
- Edit distance

Practice these patterns extensively.

Finale tips#

Top 100 ho gaye? Now bigger challenges:

Physical exam at Infosys campus
6-hour duration
Tougher problems
Live judging
Senior engineers present

Preparation:

Last 15 days mock contests daily
6-hour endurance practice
Mental stamina build karo

Pre-finale:

Travel arrangements
Stay arrangements (Infosys hosts top 100)
Rest day before exam
Eat light, sleep early

Beyond HWI#

Even if you don't win:

Top 1000 = direct interview for SE role
HWI participation = strong resume signal
Skills learned applicable to other companies

Companies that respect HWI rank:

Google, Microsoft, Amazon (interview shortcuts)
Indian product companies (Razorpay, Cred)
All major IT services

Use as leverage:

"Top 200 in HWI 2025" on resume
Network with finalists (future colleagues)
LinkedIn post for visibility

Yaad rakh#

HWI tough hai but transformative.

90 days dedicated preparation
300+ problems solved minimum
DP, graphs, trees master karo
One language fluency (C++ preferred)
Mock contests weekly

Tier-3 college se bhi log HWI win karte hai. Skills + consistency matters, not college.

JobRise pe Infosys interview prep tools use karo aur naukri secure karo.

Jiska interview is hafte hai, usko bhejo.

WhatsApp par share karo LinkedIn par share karo X par share karo