Sign inSign in

Python list

Resizable arrays that support random access, appending, and popping in constant amortized time.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Erik Demaine

    MIT · Introductory

    • 20:00Models of Computation, Random Access Machine & Document Distance

Lectures that assume it

11

Connections

22

The lectures that define it or assume it, and the concepts next to it.

1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.