DLDSA Learning StudioConcepts you can see.
Local workspace
LEARNING LAB / Overview

Learn data structures by doing

Watch an operation step by step, then try it with your own values.

Start ArraysRead an index

Explore topics

Insert 15

Arrays

Find values by index and watch them shift during insertion.

Find 42

Searching

Scan each value or halve the range in a sorted array.

Swap 7 and 3

Sorting

See how five algorithms put the same values in order.

First in, first out

Queues

Take items out in the order they arrived.

    FIND YOUR NEXT CONCEPT

    Every lesson, one place.

    38 lessons · choose one to Watch Example

    A SIMPLE WAY TO LEARN

    Watch it. Then try it.

    1. Choose a lesson, open Watch Example, and press Play. The example never changes your committed data.
    2. The highlighted pseudocode line, picture and explanation show the same step. Previous Step reviews an earlier frame; it does not undo saved data.
    3. Open Try It Yourself. Choose the inputs and run the selected operation. Indexes start at 0. For insertion, enter a Value, choose a Position, then press Insert.
    4. Cancel stops an unfinished operation. Undo Last Operation restores your previous committed structure.
    5. For sorting, open Arrays → Sorting Algorithms and choose a lesson. In Try It Yourself, use Load unsorted example or Your data, then Run the sort. A completed sort saves the ascending order; Undo restores the previous order. Start with 5–8 values to follow every comparison. Compare sorts runs all five on the same input and shows measured counts. Watch this run previews that input without changing saved data; letters on equal values reveal their original order.
    6. Build (Optional) is for manual linked-list construction. Create HEAD, create a node, then connect HEAD. Move arranges cards; Add creates nodes; Link assigns NEXT. Array and linked-list diagrams scroll independently. Use − / + to zoom, 100% to reset, Fit all to see the nodes, and Arrange to place them in rows. Drag empty space in Move mode to pan. Lists support up to 128 nodes.
    7. Undo Drawing reverses the latest Move, Add or Link. Save this List commits a valid chain; Discard Draft abandons manual construction. Drafts stay available during lesson navigation in this session.
    8. In Watch Example, choose a named example and read its goal before Play. After playback, use Check your understanding for a short reasoning question. Hint reveals one clue at a time.
    9. HEAD points to the first node. NEXT points to a successor or NULL. TAIL points to the last node. Memory details are optional.

    This app runs locally. Your playground and experiment count are saved only in this browser. Inspiration: D3 Graph Theory.

    Understand the idea

    01
    READ FIRST

    The idea in a sentence

    A little more context

      Explore the lesson

      Why it works & complexity
      Array missions · reason and earn

      SOMETHING TO NOTICE

      Operation counts

      Complexity reference

      Bounds for the implementations taught here. Extra space excludes the original input and animation frames.
      Operation or algorithmWorst case timeExtra spaceWhat determines the cost

      Compare sorting algorithms

      Your teaching data

      Enter comma-separated whole numbers. Leave blank to start empty. Your previous committed structure stays available through Undo Last Operation.