Infosys SP 3 Questions in 3 Hours 2026, Format Decoded

Scope note (13 August 2026). This page is a coding-practice plan. It does not publish a live Infosys role count, salary band, problem count, timer, language policy, or difficulty-to-offer mapping. Use the current assessment invitation and written offer for the terms that apply to you.

Before acting on a live detail, verify it against the official Infosys Careers page and the current assessment invitation you receive.

What to verify in your current Infosys communication

About the author

This guide is written by <a href="/author/aditya-sharma/" rel="author">Aditya Sharma</a>, founder of PapersAdda. It is a coding-practice sequence for arrays, strings, greedy techniques, and dynamic programming. Treat the official invitation and offer as the authority for a live Infosys assessment or role.

Operator's read, what the 3-question format actually rewards

Use this as a transferable practice plan, not as a reconstructed Infosys assessment or a prediction of an offer band.

Build from basic implementation toward harder state-based problems. Start with arrays, strings, and hash maps. Then practise greedy choices and sliding windows. Finally, write dynamic-programming recurrences before coding them. This progression is valuable even when a live assessment uses a different length, language set, or scoring rule.

Choose a language you can explain under pressure, then practise switching only if your actual platform confirms that option. For every problem, write down the input constraints you would need before choosing brute force, a linear scan, or a dynamic-programming state.

Use timed mixed sessions as a study habit rather than a prediction about an employer timer. Review the cases you missed, explain the recurrence aloud, and make a smaller version of the problem you can solve without a template.

If you have a month, reserve the final days for mixed mocks and error review. Adjust the topic mix when your official invitation names a different assessment scope.

Easy problem deep dive, the speed gate

The Easy problem is a 30 minute solve. Expect one of these patterns:

• Two-pointer array problem, like find pair with sum K or move zeros to end
• String manipulation, like longest substring without repeating character or palindrome check
• Hashmap frequency, like find first non-repeating character or majority element

The trap on Easy is overthinking. Candidates who passed competitive programming write optimal O(n) solutions on the first try. Candidates without that background often write O(n squared) brute force, which clears visible cases but times out on hidden cases. Drill optimal patterns in advance, do not try to optimize on test day.

Recommended drill, 60 LeetCode Easy plus 20 LeetCode Medium in the array plus string plus hashmap tag.

Medium problem deep dive, the Greedy gate

The Medium problem is a 60 minute solve. Almost always Greedy or sliding window, occasionally a basic graph traversal.

• Greedy small, coin-change variant, interval scheduling, activity selection
• Sliding window, longest substring with K distinct characters, minimum window substring
• Basic graph, BFS on grid, connected components count

The trap on Medium is mis-identifying Greedy as Dynamic Programming. Some Greedy problems look DP-shaped (jump-game style), but the optimal solution is Greedy with one observation. If you write DP for a Greedy problem, you waste 20 minutes and your code is harder to debug under timer.

Recommended drill, 40 LeetCode Medium in the Greedy plus sliding window tags. Practice spotting Greedy vs DP within the first 5 minutes of reading the problem.

Hard plus Complex problem deep dive, the band-defining gate

Solving the Hard problem well is one input among several that candidate reports associate with a stronger SP outcome; Infosys has not confirmed a fixed tier system tied to it. Expect DP, almost always.

• DP on arrays, knapsack variants, longest increasing subsequence, edit distance
• DP on grids, unique paths with obstacles, dungeon game
• DP on trees, house robber 3 variant, longest path in tree
• DP on graphs, shortest path with constraints, Bellman-Ford variant

The Complex problem (described by some candidates as the top difficulty tier of this test) is a layered DP, like DP plus memoization plus bitmask, or DP plus graph plus state compression. Most candidates do not solve Complex fully, but some candidate reports treat engagement (a partial solution with a correct recurrence) as a positive signal, this is not an Infosys-confirmed rule.

Recommended drill, 50 LeetCode Hard in the DP tag, focused on tree and graph DP. The Strivers DP playlist on YouTube is the most efficient sequential ramp.

Turn practice into a reliable coding habit

For every dynamic-programming drill, write the state, transition, and base cases before touching the editor. Then test a small input by hand. This helps you diagnose a bad recurrence separately from a coding bug, and it is useful across many assessment formats. It is not a claim about what an Infosys recruiter currently filters on.

30-day prep checklist for Infosys SP

• Day 1-6, array plus string plus hashmap drill, 60 LeetCode Easy plus 20 Medium, 4 hours daily
• Day 7-14, Greedy plus sliding window drill, 40 LeetCode Medium, 4 hours daily
• Day 15-22, DP on arrays plus grids deep dive, 25 LeetCode Hard, 5 hours daily
• Day 23-26, DP on trees plus graphs deep dive, 25 LeetCode Hard, 5 hours daily
• Day 27, Complex problem practice, 2 layered DP problems with bitmask plus state, 5 hours
• Day 28, full 3 hour simulation, target a stronger mix (Easy clear + Medium clear + Hard partial)
• Day 29, full 3 hour simulation, target the strongest mix (Easy clear + Medium clear + Hard full + Complex engagement)
• Day 30, gap-fill on whatever the simulations flagged, light review, sleep early

Cross-reference reading

For deeper Infosys mechanics, see the Infosys Placement Papers 2026 hub, the Infosys Interview Questions 2026 page, and the HackWithInfy 2026 Prep Strategy for the parallel Power Programmer track (alternative path to SP via the Infosys coding contest). Once you know your actual offered CTC, the CalcNook take-home calculator shows post-IT monthly figures useful for negotiation.

Related: Infosys SP/DSE coding questions 2026, for the full topic-frequency breakdown and 47 practice questions with solutions.

Related: Infosys off-campus drive 2026 complete guide, for current eligibility, registration windows, and step-by-step apply flow.

Related: Infosys salary progression and promotions, to see year-by-year CTC growth, hike patterns, and band-jump timelines.

Related: LeetCode questions asked in TCS 2026, for the verified question-frequency analysis and pattern-wise prep approach.