Curated list of the most repeated coding questions asked in Infosys Specialist Programmer (SP) & Digital Specialist Engineer (DSE) rounds — collected from GitHub repos, PrepInsta, Reddit discussions, LinkedIn experiences, HackWithInfy patterns, and real candidate feedback.
Most students prepare randomly.
That fails badly in Infosys SP/DSE.
This sheet is designed to help you:
- Focus on high-frequency patterns
- Avoid wasting time on useless topics
- Prepare strategically in limited time
- Understand actual SP/DSE difficulty
- Crack coding rounds faster
| Question | Difficulty | Topics | Marks |
|---|---|---|---|
| Q1 | Easy | Arrays, Strings, Basic DS | 20 |
| Q2 | Medium | Greedy, Sliding Window, Recursion | 30 |
| Q3 | Hard | DP, Graphs, Advanced Logic | 50 |
⏱ Duration: 3 Hours
These patterns appear again and again in Infosys SP/DSE.
| Pattern | Frequency |
|---|---|
| Arrays + HashMap | 🔥🔥🔥🔥🔥 |
| Sliding Window | 🔥🔥🔥🔥 |
| Greedy Optimization | 🔥🔥🔥🔥 |
| Prefix Sum | 🔥🔥🔥 |
| Dynamic Programming | 🔥🔥🔥🔥🔥 |
| Bit Manipulation | 🔥🔥🔥🔥 |
| Recursion + Backtracking | 🔥🔥🔥 |
| Graphs | 🔥🔥 |
| Binary Search on Answer | 🔥🔥🔥 |
| String Manipulation | 🔥🔥🔥🔥 |
Based on recent discussions and candidate experiences.
- Andy's Vacation
- Minimum Platforms Required
- Minimize Ugliness of Binary String
- Maximum Vacation Days
- Count Arrays with Divisibility Condition
- Monster Defeat Problem
- Mountain Array Minimum Changes
- XOR Sum Maximization
- Largest Number from Array
- Difference Between Odd & Even Index Elements
- Minimum Coins Required
- Wine Bottle Transport
- LIS with Bitwise Condition
- Remove Digit to Maximize Number
If your test is tomorrow, DO NOT try to complete entire DSA.
That’s panic-prep garbage.
Instead solve these:
- Two Sum
- Palindrome
- Frequency Count
- Rotate Array
- Binary Search
- Valid Parentheses
- Largest Number from Array
- Kadane’s Algorithm
- Minimum Platforms
- Coin Change
- Sliding Window Problems
- Merge Intervals
- Next Greater Element
- LCS
- Knapsack
- Subset Sum
- XOR Problems
- Dijkstra
- Edit Distance
- Arrays
- Strings
- HashMap
- Sorting
- Sliding Window
- Greedy
- Prefix Sum
- Binary Search
- DP Basics
- Knapsack
- LCS
- Subset Sum
- Timed Mock Tests
- Previous Questions
- Revision
Priority:
- Arrays
- HashMap
- Sliding Window
- Greedy
- Kadane
- DP Basics
- Bit Manipulation
Ignore:
- Advanced Trees
- Segment Trees
- Complex Graph Theory
- Competitive Programming tricks
| Topic | Difficulty | Importance |
|---|---|---|
| Arrays | Easy | ⭐⭐⭐⭐⭐ |
| Strings | Easy | ⭐⭐⭐⭐⭐ |
| HashMap | Easy | ⭐⭐⭐⭐⭐ |
| Sliding Window | Medium | ⭐⭐⭐⭐⭐ |
| Greedy | Medium | ⭐⭐⭐⭐⭐ |
| Prefix Sum | Medium | ⭐⭐⭐⭐ |
| Bit Manipulation | Medium | ⭐⭐⭐⭐ |
| Dynamic Programming | Hard | ⭐⭐⭐⭐⭐ |
| Graphs | Hard | ⭐⭐⭐ |
| Backtracking | Hard | ⭐⭐⭐ |
- Reverse a String / Array
- Check Palindrome
- Find Maximum & Minimum in Array
- Count Frequency of Elements
- Anagram Check
- Remove Duplicates from Array
- Sum of Digits
- Difference Between Odd & Even Index Elements
- Valid Parentheses
- Fibonacci Series
- Largest Number from Array
- Second Largest Element
- Count Vowels & Consonants
- Rotate Array by K
- Binary Search
- nCr Calculation
- Two Sum Problem
- Maximum Vacation Days
- Coin Change
- Activity Selection
- Minimum Platforms
- Kadane’s Algorithm
- Binary String to Decimal
- Count Divisible Subarrays
- XOR Single Number
- Next Greater Element
- Minimize Ugliness of Binary String
- Longest Common Prefix
- Merge Overlapping Intervals
- Wine Bottle Transport
- Sort Characters by Frequency
- Maximum XOR of Two Numbers
- Remove Digit to Maximize Number
- Subset Sum Check
- Count Arrays with Divisibility Condition
- LIS with Bitwise Condition
- Monster Defeat Problem
- Minimum Base with Identical Digits
- Minimum Days for Terrain Road
- Mountain Array Minimum Changes
- Pack Gifts into K Boxes
- Longest Common Subsequence
- 0/1 Knapsack
- Word Break Problem
- Max XOR-Sum(x)
- Maximum XOR Subset
- Dijkstra Algorithm
- N-Queens
- Combination Sum
- Edit Distance
- https://prepinsta.com/infosys-sp-and-dse/coding-questions/
- https://leetcode.com/
- https://www.geeksforgeeks.org/
- https://www.hackerrank.com/
- https://www.reddit.com/r/developersIndia/comments/1pmi730/infosys_specialist_programmer_coding_round_for/
- https://www.linkedin.com/posts/infosys-spdse-50-coding-questions-ugcPost-7399358452784914432-vKME/
- Solve under time pressure
- Practice writing bug-free code fast
- Learn input/output handling properly
- Partial scoring exists — optimize for passing more test cases
- Python is fastest for implementation-heavy questions
- Don’t get stuck on Q3 too early
If this helped you:
- Star the repo
- Share with friends
- Fork and improve
- Contribute more real questions
Helping students prepare smarter, not harder.
Instagram: https://www.instagram.com/codingkashtalu/