Infosys Specialist Programmer (SP) Coding Questions & Syllabus | MassHiring OS

Inside Infosys Differential Hiring: SP vs SE

Infosys hires through two distinct paths: standard **Systems Engineer (SE)** at ₹3.60 LPA and the elite **Specialist Programmer (SP)** track paying **₹9.50 LPA** (with Digital Specialist Engineer at ₹6.25 LPA).

Candidates qualifying for SP undergo rigorous hands-on coding tests where test-case execution speed and space constraints are strictly checked.

1. Exam Structure for Specialist Programmer - Total Duration: 3 Hours (180 Minutes) - Question Count: 3 Coding Problems - Problem 1 (Easy-Medium): 50 Marks (Greedy / String Manipulation) - Problem 2 (Medium-Hard): 75 Marks (Tree / Graph Traversal, BFS/DFS) - Problem 3 (Hard): 100 Marks (Multi-dimensional Dynamic Programming)

*Passing Benchmark*: To secure the SP (₹9.5 LPA) interview call, you must completely pass Problem 1 and Problem 2, with at least 50% public test cases passing on Problem 3.

2. Core Topics Tested 1. Dynamic Programming: 0/1 Knapsack variations, Longest Increasing Subsequence, Bitmask DP. 2. Graph Algorithms: Dijkstra's algorithm, Topological Sort, Disjoint Set Union (DSU). 3. Number Theory: Modular arithmetic, Prime factorization, Sieve of Eratosthenes.

Infosys Specialist Programmer (₹9.5 LPA) & DSE: Hard DSA Questions & Pseudocode

Inside Infosys Differential Hiring: SP vs SE

2. Core Topics Tested 1. Dynamic Programming: 0/1 Knapsack variations, Longest Increasing Subsequence, Bitmask DP. 2. Graph Algorithms: Dijkstra's algorithm, Topological Sort, Disjoint Set Union (DSU). 3. Number Theory: Modular arithmetic, Prime factorization, Sieve of Eratosthenes.

Practice Infosys Memory PYQs on Live Compiler

Recommended Preparation Guides

Deloitte National Level Assessment (NLA): Associate Analyst Pattern & STAR Dossier

Capgemini Excelerator (₹7.5 LPA): Game-Based Aptitude & Pseudocode Guide

Cognizant GenC Elevate: How to Clear AMCAT Automata Fix Debugging in 20 Mins

Sign Up to Receive Our Latest
Updates

Inside Infosys Differential Hiring: SP vs SE

2. Core Topics Tested 1. **Dynamic Programming**: 0/1 Knapsack variations, Longest Increasing Subsequence, Bitmask DP. 2. **Graph Algorithms**: Dijkstra's algorithm, Topological Sort, Disjoint Set Union (DSU). 3. **Number Theory**: Modular arithmetic, Prime factorization, Sieve of Eratosthenes.

Practice Infosys Memory PYQs on Live Compiler

Recommended Preparation Guides

Deloitte National Level Assessment (NLA): Associate Analyst Pattern & STAR Dossier

Capgemini Excelerator (₹7.5 LPA): Game-Based Aptitude & Pseudocode Guide

Cognizant GenC Elevate: How to Clear AMCAT Automata Fix Debugging in 20 Mins

Sign Up to Receive Our LatestUpdates

2. Core Topics Tested 1. Dynamic Programming: 0/1 Knapsack variations, Longest Increasing Subsequence, Bitmask DP. 2. Graph Algorithms: Dijkstra's algorithm, Topological Sort, Disjoint Set Union (DSU). 3. Number Theory: Modular arithmetic, Prime factorization, Sieve of Eratosthenes.

Sign Up to Receive Our Latest
Updates