Shelf · DSA Patterns
DSA Patterns
Patterns and recognition tricks only. No problems or solutions here; practise in your DSA book.
Problems and solutions live in your existing DSA book. This book is patterns only.
Difficulty
Priority
- Clarify the input and output contractEasyP1Know cold
- Sequence signals and competing patternsMediumP2Know cold
- Search, rank and frontier signalsMediumP2Know cold
- Dependency and repeated-state signalsMediumP3Talk about it
- Translate constraints into feasible complexityMediumP1Know cold
- State and challenge the invariantMediumP2Know cold
Difficulty
Priority
- Complexity and amortizationMediumP1Know cold
- Derive cost from work rather than indentationMediumP1Know cold
- Read the common-complexity tableEasyP1Know cold
- Account for auxiliary and output spaceMediumP2Know cold
- Count recursive calls and stack depth separatelyMediumP2Know cold
- Know when quadratic work is acceptableEasyP2Talk about it
Difficulty
Priority
- Arrays and dynamic-array operation costsEasyP1Know cold
- Hash maps and sets under stated assumptionsEasyP1Know cold
- Stacks, queues and dequesEasyP1Know cold
- Heaps as partial orderMediumP2Know cold
- Trees and tries by key structureMediumP2Talk about it
- Graphs, union-find and the which-one tableMediumP3Talk about it
Difficulty
Priority
- Two pointers and safe in-place movementMediumP2Know cold
- Fixed sliding windowsEasyP2Know cold
- Variable sliding windowsMediumP2Know cold
- Prefix sums and range accountingMediumP2Know cold
- Fast and slow pointer invariantsMediumP2Know cold
- Merge intervals and cyclic sort prerequisitesMediumP2Know cold
Difficulty
Priority
- Binary search with a boundary invariantMediumP2Know cold
- Binary search on the answerHardP3Know cold
- Sort then scan without losing the contractMediumP2Know cold
- Top-K with bounded heapsMediumP2Know cold
- Quickselect as rank partitioningHardP4Talk about it
- Monotonic stacks and queuesMediumP3Know cold
Difficulty
Priority
- DFS templates and traversal stateMediumP2Know cold
- BFS, level-order and grid traversalMediumP2Know cold
- Backtracking with reversible stateMediumP3Know cold
- Topological sort and dependency cyclesMediumP3Know cold
- Union-find for changing connectivityMediumP3Talk about it
- Dijkstra with explicit heap assumptionsHardP3Talk about it
Difficulty
Priority
- Define a sufficient DP stateHardP3Know cold
- Derive recurrence and dependency orderHardP3Know cold
- Memoization versus tabulation in 1D and 2DMediumP3Know cold
- Recognize the knapsack familyHardP3Talk about it
- LIS and string DP state familiesHardP3Talk about it
- Space optimization without losing dependenciesHardP4Talk about it
Difficulty
Priority
- A minute-by-minute coding-round protocolEasyP5Know it exists
- Think aloud at decision pointsEasyP2Talk about it
- Dry-run on paper with a state ledgerMediumP2Know cold
- Test your own implementationMediumP1Know cold
- Recover when stuck without bluffingMediumP2Talk about it
- Python-specific interview mechanicsMediumP2Know cold
Difficulty
Priority
- Pattern practice systemEasyP5Know it exists
- Spaced recall with adjustable intervalsEasyP5Know it exists
- Mix patterns to test recognitionMediumP5Know it exists
- A self-assessment rubric with evidenceEasyP5Know it exists
- Log a solved problem so learning compoundsEasyP5Know it exists
- Review the rotation and choose the next repairMediumP5Know it exists
No cards match these filters.