Skip to content

The DSA Woodshed

Home Guide Reference Algorithms

Search the site

Search the reference sheets, guide, and algorithm pages. Results update as you type.

Mode

Search the site

Search the reference sheets, guide, and algorithm pages. Results update as you type.

The DSA Woodshed

Home Guide Reference Algorithms

Guide

Interview Practice Evidence
Getting Started
When to Use What
Learning Paths
Source of Truth

Algorithms

Arrays
Backtracking
Bit Manipulation
Dynamic Programming
Graphs
Greedy
Heaps
Linked Lists
Patterns
Recursion
Searching
Sliding Window
Sorting
Stacks & Queues
Strings
Trees
Two Pointers

Reference sheets

Python Standard Library
Data Structures
Algorithm Templates
Big-O Complexity
Common Patterns
System Design
Interview Day Guide
Cross-Reference Guide
Python 3.14 & Modern Patterns
Whiteboard Performance & Panic Protocol
14-Day Whiteboard Ramp

Mode

The DSA Woodshed
Algorithms
Sorting

Sorting

Merge Sort Inversions
Merge Sort Inversions — count inversions using merge sort
Quickselect
Quickselect — find the kth smallest element

A reading surface for the DSA study packet. Content is tracked in git; every page links to its source.

Study packet Security