Skip to content
LearnStack
DSA curriculum

DSA

13 lessons ready

Data structures and algorithms, with step-by-step visual animations.

0/13 done0%
Start from lesson 1 Practice (3)

Beginner

  1. Big-O basics

    Learn how to describe how fast an algorithm is, without a stopwatch.

    8 minFree preview

  2. Arrays

    How arrays store items side by side, and why reading is fast but inserting is slow.

    8 minFree preview

  3. Hash maps

    Look things up by key in constant time, and use a hash map to count and remember.

    8 min Account

  4. Stacks

    Last in, first out. Push, pop and peek, and see a stack in action.

    7 min Account

  5. Queues

    First in, first out. Enqueue and dequeue, and see how a queue differs from a stack.

    7 min Account

Intermediate

  1. Linked lists

    Nodes that point to each other. Cheap inserts, but no jumping to an index.

    9 min Account

  2. Sorting

    Put items in order, starting with bubble sort and a visual trace of every swap.

    9 min Account

  3. Binary search

    Find a value in a sorted list by cutting the search area in half each step.

    8 min Account

  4. Binary trees

    Nodes with up to two children, binary search trees, and the ways to walk through a tree.

    9 min Account

  5. Strings

    Work with text: indexing, reversing, palindromes, anagrams and the two-pointer technique.

    9 min Account

  6. Recursion

    Functions that call themselves: the base case, the recursive case and the call stack.

    9 min Account

Advanced

  1. Graphs

    Nodes and edges, adjacency lists, and the two core traversals: breadth-first and depth-first search.

    10 min Account

  2. Dynamic programming basics

    Remember sub-answers instead of recomputing them: memoization and tabulation, with Fibonacci and climbing stairs.

    10 min Account