1. Infosys SP & DSE Exam Pattern & Selection Rounds (2026)
The 2026 Infosys Specialist Programmer & DSE selection pipeline eliminates ~75% of candidates in Round 1 on Infosys HackWithInfy / InfyTQ. Review the exact round-by-round timing and difficulty matrix below:
| Selection Stage / Section | Questions / Format | Duration | Difficulty Level |
|---|---|---|---|
| Online 3-Hour Competitive Coding Test | 3 Coding (Easy, Med, Hard) | 180 Mins | Hard |
| Single Technical + HR Panel Interview | DSA + Projects + SQL | 45–60 Mins | Medium–Hard |
2. High-Weightage Syllabus & Eligibility Criteria
Minimum Eligibility Cutoff: 60% aggregate / Open via HackWithInfy. Hiring locations include Bangalore, Pune, Hyderabad, Mysore, Noida.
- Priority Area 1: Dynamic Programming, Greedy & Graph Shortest Path (SP Track)
- Priority Area 2: Strings, Sliding Window & Binary Search (DSE Track)
- Priority Area 3: SQL Window Functions, Normalization & Spring/React Projects
- Priority Area 4: Time/Space Complexity Optimization (Passing All Hidden Test Cases)
3. Frequently Asked Infosys SP & DSE Coding & Technical Questions (With Solutions)
Q1. Subarray Sum Equals K (Prefix Sum + HashMap — O(N))
Given an integer array nums and an integer k, return the total number of continuous subarrays whose sum equals k. Frequently asked in 2026 online coding rounds.
def subarray_sum(nums, k):
prefix_counts = {0: 1}
curr_sum = 0
total = 0
for x in nums:
curr_sum += x
total += prefix_counts.get(curr_sum - k, 0)
prefix_counts[curr_sum] = prefix_counts.get(curr_sum, 0) + 1
return total
# Time Complexity: O(N) | Space Complexity: O(N)
Q2. LRU Cache Implementation (O(1) Get & Put)
Design a Least Recently Used (LRU) Cache supporting get(key) and put(key, value) in strict O(1) time complexity using an OrderedDict / Doubly Linked List + HashMap.
from collections import OrderedDict
class LRUCache:
def __init__(self, capacity: int):
self.cap = capacity
self.cache = OrderedDict()
def get(self, key: int) -> int:
if key not in self.cache:
return -1
self.cache.move_to_end(key)
return self.cache[key]
def put(self, key: int, value: int) -> None:
if key in self.cache:
self.cache.move_to_end(key)
self.cache[key] = value
if len(self.cache) > self.cap:
self.cache.popitem(last=False)
Q3. SQL Second Highest Salary per Department (Window Function)
Write a production-grade SQL query to fetch the top 2 highest-paid employees in each department, correctly handling ties.
WITH RankedEmployees AS (
SELECT department_id, emp_name, salary,
DENSE_RANK() OVER (PARTITION BY department_id ORDER BY salary DESC) AS rnk
FROM employees
)
SELECT department_id, emp_name, salary
FROM RankedEmployees
WHERE rnk <= 2;
4. Frequently Asked Questions — Infosys SP & DSE Recruitment 2026
What is the Infosys SP & DSE placement test pattern in 2026?
The 2026 Infosys Specialist Programmer & DSE recruitment drive consists of 2 stages starting on Infosys HackWithInfy / InfyTQ (180 Mins), followed by technical DSA/system interviews and HR fitment.
What salary package does Infosys SP & DSE offer freshers in India?
Selected freshers and entry-level engineers earn ₹6.25 LPA (DSE) – ₹9.5 LPA (SP) across Bangalore, Pune, Hyderabad, Mysore, Noida.
How can 4Achievers help me crack the Infosys SP & DSE interview?
4Achievers runs intensive DSA, Full Stack, Data Analytics, and Cloud interview bootcamps with live mentor sessions, 1-on-1 mock panels, and dedicated placement support across 15 Physical Training Centers and live online batches.