Year 1 · Quarter 1 Intermediate Ruby

Introduction to Algorithms and Complexity

Introduction to Algorithms and Complexity covers: Core Topics, Core Topics (continued). Year 1, Quarter 1. Includes 12 exercises and 2 projects.

46 hours · 9 lessons · 1 enrolled
Locked

Complete Discrete Mathematics first

Course locked

Complete Discrete Mathematics to unlock this course.

Prerequisites

Discrete Mathematics

Complete all prerequisites to enroll in this course.

Learning Resources

6 curated resources to study this course

Primary Resources

— Study these first
Abdul Bari Algorithms (YouTube) FREE

80+ videos covering Big O, recurrences, Master theorem, sorting, searching, DP, greedy, graph algorithms. Extremely clear whiteboard teaching style.

MIT 6.006 Introduction to Algorithms (OCW) FREE

Erik Demaine's legendary course. Problem sets are excellent. More rigorous than Abdul Bari.

Secondary Resources

— Fill gaps or get a different explanation
Boot.dev Big O Course PAID: Boot.dev

Interactive exercises, shorter format. Good warmup before MIT 6.006.

NeetCode Roadmap — Big O section PAID: NeetCode

Quick refresher with video explanations.

Big O Notation Guide FREE

Your personal Big O reference.

Reference

— For lookup, not sequential reading
Introduction to Algorithms (CLRS) PAID (~$80)

The bible of algorithms. Dense but comprehensive. Use specific chapters as reference alongside MIT 6.006.

Lessons

2 readings 4 exercises 2 projects 1 assessment
1

Core Topics

Enroll to access
2

Core Topics (continued)

Enroll to access
3

Exercises: Easy (Warm-up)

Enroll to access
4

Exercises: Medium (Core)

Enroll to access
5

Exercises: Hard (Stretch)

Enroll to access
6

Mini-Project

Enroll to access

Project: Complexity Analyzer

PROJECT
Enroll to access

Project: Algorithm Race

PROJECT
Enroll to access

Self-Assessment: Introduction to Algorithms and Complexity

ASSESSMENT
Enroll to access