Skip to content
Search lessons, topics, tests…
Esc

    ↑ ↓ moveEnter openEsc close
    Coding Practice and Application Labs: back to the track

    Guided course · Coding Practice and Application Labs

    Recursion, Dynamic Programming and Backtracking in C#

    • Trace recursive calls and identify base cases.
    • Turn repeated work into memoized or tabulated solutions.
    • Build backtracking solutions with undo steps and pruning.
    • Practise patterns from Climbing Stairs to Knapsack and N-Queens.
    Intermediate7 modules · 31 lessons · 6 h 5 min · 2 free
    Start the courseSave

    Module 1 · Recursion Fundamentals

    4 lessons · 40 min
    1. 01What recursion is, with your first function tracedFree9 min
    2. 02The leap of faith (the skill that makes recursion click)Free9 min
    3. 03Core recursion patterns in C# and how to hand-trace them (included with Full Access)11 min
    4. 04Common recursion mistakes (and their C# symptoms) (included with Full Access)11 min

    Module 2 · From Recursion to Memoization

    4 lessons · 41 min
    1. 05When to use recursion and when to prefer a loop (included with Full Access)10 min
    2. 06Why naive recursion is slow: the Fib(6) recursion tree (included with Full Access)10 min
    3. 07Top-down memoization and bottom-up tabulation (included with Full Access)11 min
    4. 08Space optimization, and top-down vs bottom-up (included with Full Access)10 min

    Module 3 · Recognizing and Solving DP Problems

    4 lessons · 44 min
    1. 09How to recognize a DP problem in the wild (included with Full Access)11 min
    2. 10Climbing Stairs: the 'hello world' of DP (included with Full Access)10 min
    3. 11House Robber: introducing a real decision (included with Full Access)11 min
    4. 12Coin Change: the first minimum DP, and a famous greedy trap (included with Full Access)12 min

    Module 4 · 2D DP, Knapsack and Backtracking

    4 lessons · 46 min
    1. 13Unique Paths and Longest Common Subsequence: 2D state (included with Full Access)13 min
    2. 140/1 Knapsack: the capstone pattern (included with Full Access)12 min
    3. 15What backtracking is, and how it differs from DP (included with Full Access)10 min
    4. 16The universal backtracking template (included with Full Access)11 min

    Module 5 · Subsets, Permutations and N-Queens

    4 lessons · 45 min
    1. 17Subsets: the cleanest first example (included with Full Access)11 min
    2. 18Permutations and Combination Sum: undo and pruning (included with Full Access)12 min
    3. 19N-Queens: the famous one, briefly (included with Full Access)11 min
    4. 20Why these topics, specifically (included with Full Access)11 min

    Module 6 · Interview Relevance and Practice Plan

    4 lessons · 42 min
    1. 21Will a C# developer be asked this in interviews? (included with Full Access)10 min
    2. 22The one-page mental model (included with Full Access)10 min
    3. 23Recurrence quick reference and the interview script (included with Full Access)11 min
    4. 24A 4-week basics-first practice plan (45–60 min/day) (included with Full Access)11 min

    Module 7 · Module Practice Tests and Final Mock

    7 lessons · 1 h 47 min
    1. 25Practice Test: Recursion Fundamentals (included with Full Access)12 min
    2. 26Practice Test: From Recursion to Memoization (included with Full Access)12 min
    3. 27Practice Test: Recognizing and Solving DP Problems (included with Full Access)12 min
    4. 28Practice Test: 2D DP, Knapsack and Backtracking (included with Full Access)12 min
    5. 29Practice Test: Subsets, Permutations and N-Queens (included with Full Access)12 min
    6. 30Practice Test: Interview Relevance and Practice Plan (included with Full Access)12 min
    7. 31Final Mock Interview: 25 Questions on Recursion, DP and Backtracking in C# (included with Full Access)35 min

    TechInterviewNotes Editorial Team ·