Video summary

Infosys SP & DSE Coding Round 2026 😰 The 6 Patterns That Decide It (Exam This Week)

Main summary

Key takeaways

Educational

Main ideas / concepts / lessons

  • Scenario & motivation: A student (“Alex”) receives an email about the Infosys online coding assessment for the SP and/or DSC coding round and panics because they don’t know what will be asked.
  • Core claim: Although the test can feel hard, the speaker argues that the problems usually reduce to six repeating patterns.
  • Preparation strategy: Stop random grinding and instead focus on what tends to repeat, then practice both coding and communication under time pressure.
  • Role mapping (what you’re applying for):
    • System Engineer (SE): largest intake role.
    • Digital Specialist Engineer (DSC): “one level up” from SE.
    • System Oriented Specialist Programmer (SP): premium, toughest coding bar.
  • Key insight about overlap: SP and DSC coding rounds come from the same pattern pool, so preparing for SP covers both.
  • Exam performance is not only about getting the right code: Evaluators also watch how you think—including explaining your approach, handling edge cases, and stating time complexity.
  • Three common mistakes that get candidates rejected:
    1. Memorizing solutions instead of understanding.
    2. Getting stuck when the question twists.
    3. “Silent coding” (thinking without explaining), plus failure to cover edge cases (empty input, single element, negatives).

Methodology / instructions (detailed)

1) Choose the right study focus by role

  • If aiming for DSC (and you’re above SE):
    • Focus on DSC pattern set (as described).
  • If aiming for SP or DSC:
    • Prepare for SP because SP + DSC share the same pattern pool.
  • If you can handle SP-level prep:
    • Approach it with confidence (“aim one level up”).

2) Avoid random problem grinding

  • Don’t “open LeetCode at 2:00 a.m.” and grind thousands of unrelated problems.
  • Instead, ask: What actually repeats in this OA round?
  • Use the six-pattern framework to guide practice.

3) Practice the six repeating patterns (with example problem types)

Pattern 1: Grid problems solvable with BFS/DFS

  • Master BFS and DFS on grids.
  • Typical examples mentioned:
    • Rotting Oranges (modified)
    • Number of Islands
    • Alien Dictionary
    • “Count groups of connected ships” style grid-connectivity questions

Pattern 2: Dynamic Programming (DP)

  • DP is described as the highest-weight topic for SP/DSC.
  • For SP tier, backtracking/recursion also appears, but DP is emphasized.
  • Typical DP examples mentioned:
    • Climbing Stairs (classic “pattern” DP)
    • Count of subsets with a given sum
    • Longest Increasing Subsequence (LIS)
    • Fibonacci, including requests to implement in DP fashion (not just a simple loop)
  • Additional requirement mentioned:
    • Questions may ask for time complexity
    • Optimize without temporary variables (speaker’s example constraint)

Pattern 3: Arrays and Intervals

  • Emphasis is on interval-related problems as a repeating “favorite.”
  • Typical examples mentioned:
    • Insert Interval (explicitly called repeat/favorite)
    • Merging two sorted arrays
    • Gas station problem (noted as potentially related to DP/greedy)
    • Binary search applications
    • Circular array / circular problems
  • Instruction implied:
    • Practice until boundary handling becomes automatic.

Pattern 4: Strings

  • Typical string problem types:
    • Remove adjacent duplicates (often stack-based)
    • Next smallest palindrome
    • Swap and reversal style tasks
  • Lesson:
    • String logic must remain clean under pressure; messy loops can fail hidden/test cases.

Pattern 5: Design

  • Many freshers skip design; speaker claims this is a differentiator at SP level.
  • Examples mentioned:
    • Implement an LRU cache
    • Build a hash map from scratch
  • Instruction:
    • Spend real time on design-based questions.
    • Pair design prep with DP, since many candidates miss what the speaker describes.

Pattern 6: Deceptively easy basics (often asked under timer)

  • Examples mentioned:
    • Swap two numbers without a third variable
    • Bit manipulation (e.g., “bulb toggling” type)
    • Quick recursion questions
  • Key instruction:
    • Practice explaining logic out loud while coding, because interviewers often watch your reasoning.

4) During the assessment: communicate like an interview

  • Before typing:
    • Explain the approach
  • While coding:
    • Handle edge cases without being prompted
  • After/while presenting:
    • State complexity even if not asked
  • Principle:
    • Two candidates can get the correct answer; the one who communicates clearly gets the offer.

Practical checklist (implied from the speaker)

  • [ ] Know your target role (SE vs DSC vs SP) and prepare for the shared SP/DSC pattern pool.
  • [ ] Study the six patterns: BFS/DFS grids, DP, arrays+intervals, strings, design, basics/bit/recursion.
  • [ ] Practice DP specifically in the expected “DP style” (e.g., Fibonacci via DP).
  • [ ] Practice explaining your logic out loud while coding.
  • [ ] Avoid memorization; understand patterns so you can handle twists.
  • [ ] Always cover edge cases: empty input, single element, negatives.
  • [ ] Clearly communicate: approach, edge cases, and time complexity.

Sources / speakers / participants (as featured)

  • Primary speaker / narrator: The YouTube presenter (referred to as mentoring candidates; runs mock interviews and promotes resources).
  • Character used as example: Alex (a student in the story; not an external documented source, but a named example participant).
  • Platform / external entities mentioned:
    • Infosys (assessments: SP and DSC coding rounds)
    • LeetCode (mentioned as where candidates might grind randomly)
    • LinkedIn (mentioned as containing many problems)
    • PrimeCoding.in (mock interviews and resources)
    • Hack with Infosys and InfosysTQ certifications (mentioned as a route into SP/DSC)

Original video