← Back to Courses
Computer Scienceintermediate
CS-201

Data Structures & Algorithms

When you finish, you can

Pick the right data structure and algorithm for a problem, implement it, and explain its speed in Big-O terms.

Start hereYou need CS-101. Implement every structure yourself before using the library version.

9 hours total5 Chapters20 Lessons1 Exams3 CreditsFREE
Start This CourseFree. No account required.

Debate a counselor

Take a position on Data Structures & Algorithms. The AI counselor argues the other side, asks you questions back, and cites a source for every fact it states. Sources listed under a reply are the pages it actually found; if none are listed, it is arguing from reasoning only. It is an AI and it can be wrong: check the sources.

    What changed

    Loading…

    Discuss this course

    A room for people taking this course, in any language, translated for every reader. Open breakout rooms for one question at a time.

    Enter the course room
    Prerequisites::CS-101 Introduction to Python

    Course Syllabus

    9h total

    Practice

    1. Write a singly linked list with append, insert-at-front and delete.
    2. Time inserting 100,000 items at the front of a Python list versus your linked list.
    3. Add a doubly linked list and a `reverse()` method.

    Check

    Why is inserting at the front O(n) for an array and O(1) for a linked list?

    Topics Covered

    data-structuresalgorithmsbig-o

    Ready to start?

    Free. No account required. Progress saves in this browser — no account exists.

    Start This Course