Back to Explore
Computer ScienceUndergraduate 4.9 · 4,900

Data Structures & Algorithms

Arrays, trees, hashing, and Big-O — write code that scales.

Prof. Wei Zhang, Professor of Computer Science

Prof. Wei Zhang

Professor of Computer Science

Course progress0 / 4 lessons
1

Big-O Notation

Reason about how code scales.

9 min +75 XP2 quiz questions
2

Sorting Algorithms

Putting data in order, and what it costs.

9 min +75 XP2 quiz questions
3

Hash Tables

Near-instant lookup by key.

9 min +60 XP2 quiz questions
4

Recursion & Divide and Conquer

Solve a problem with smaller copies of itself.

9 min +60 XP2 quiz questions

Common questions

Who is "Data Structures & Algorithms" for?

It is written for learners at Undergraduate level (College), and for anyone older who wants a clear refresher on computer science. Arrays, trees, hashing, and Big-O — write code that scales. There is no application or entry test — you can start the first lesson straight away.

How long does the course take?

There are 4 lessons totalling 36 minutes of reading and quizzes, laid out over 2 units. You can move at your own pace — progress is saved as you go.

What do I need to know before starting?

No prior coursework is assumed. The course opens with "Complexity", covering big-o and trade-offs, so the foundations are built in rather than expected.

Is the course free?

Yes. Every course on Monster Class is completely free, with no credit card, trial period or paywall. Creating a free account simply saves your progress, XP and place on the leaderboard across devices.