Schoolhouse.world: peer tutoring, for free.
Schoolhouse.world: peer tutoring, for free.

Math

Algebra 2 Learning Labs
Pre-Calculus Learning Labs
Pre-Algebra
Algebra 1
Algebra 2
Geometry
Pre-Calculus
Calculus
Statistics

Science

Biology
Chemistry
Physics

More

SAT Bootcamp
College Admissions Workshops
SAT Prep
College Prep
Enrichment
Computer Science
Reading and Writing
History
Free SAT® Prep, as part of a research study.
SAT® Bootcamps
Free SAT® Prep, as part of a research study.
Get free help applying to college.
College Admissions Workshops
Get free help applying to college.
1-on-1 conversations on global topics
Dialogues
1-on-1 conversations on global topics
A global network of volunteers.
Explore Tutors
A global network of volunteers.
Why get tutored by other students?
Benefits of Peer Tutoring
Why get tutored by other students?
Prove your mastery and get ready to tutor.
About Certifications
Prove your mastery and get ready to tutor.
Learn, grow, and give back through tutoring.
Become a Tutor
Learn, grow, and give back through tutoring.
How we keep virtual tutoring safe.
Session Safety Measures
How we keep virtual tutoring safe.
Have questions? Search our FAQ.
Help Desk
Have questions? Search our FAQ.
Game nights, product updates, and more.
Community Events
Game nights, product updates, and more.
Stay motivated in virtual study rooms.
Study Spaces
Stay motivated in virtual study rooms.
Check out the community's impact.
Leaderboards
Check out the community's impact.
Testimonials from the Schoolhouse community.
Stories
Testimonials from the Schoolhouse community.
Keep up with our volunteer-run blog.
Blog
Keep up with our volunteer-run blog.
Data Structures and Algorithms

SAT Score Range

•

12 sessions

•

+15

This series ended on March 30, 2025. All 1:1 and group chats related to this series are disabled 7 days after the last session.

About

Each week, we will go over a data structure and/or algorithm to explore everything needed in a standard course.

Tutored by

Long N 🇺🇸

Certified in 1 topic

View Profile

I'm a high school student in the Houston, Texas area. I plan on applying for a computer science degree late on in my life so I am very proficient in STEM areas.

Schedule

✋ ATTENDANCE POLICY

Each session is crucial and missing one requires makeup work. If you have missed one, please message me so that I could brief you on what we discussed for some contents will be referenced later. If the terms aren't met, then I'm afraid you will be withdrawn from the series.

SESSION 1

12

Jan

SESSION 1

Python

Python

Sun 10:30 AM - 12:00 PM UTCJan 12, 10:30 AM - 12:00 PM UTC

This session will cover recursion and big O notation which is used in a lot of algorithms from sorting to backtracking. If you think you have learned thoroughly on the topic of recursion, please message me so that I can test your knowledge.
SESSION 2

18

Jan

SESSION 2

Review

Review

Sat 10:30 AM - 11:30 AM UTCJan 18, 10:30 AM - 11:30 AM UTC

We will go over everything to make sure we are all on the same boat.
SESSION 3

19

Jan

SESSION 3

Python

Python

Sun 10:30 AM - 12:00 PM UTCJan 19, 10:30 AM - 12:00 PM UTC

In this session, we will go over 3 sorting algorithms which are insertion, selection, and bubble sort. This will be the first real algorithms course so we will ease our way until thinking algorithmically to get into the more advance algorithms with time complexity.
SESSION 4

25

Jan

SESSION 4

Review

Review

Sat 10:30 AM - 12:00 PM UTCJan 25, 10:30 AM - 12:00 PM UTC

Selection Sort and Insertion Sort.
SESSION 5

26

Jan

SESSION 5

Python

Python

Sun 10:30 AM - 12:00 PM UTCJan 26, 10:30 AM - 12:00 PM UTC

In this session, we will go over merge sort and its application along with time complexity.
SESSION 6

9

Feb

SESSION 6

Python

Python

Sun 10:30 AM - 12:00 PM UTCFeb 9, 10:30 AM - 12:00 PM UTC

In this session, we will go over heap sort and its application with time complexity in mind.
SESSION 7

23

Feb

SESSION 7

Python

Python

Sun 10:30 AM - 12:00 PM UTCFeb 23, 10:30 AM - 12:00 PM UTC

In this session, we will go over backtracking with permutations in mind along with a new time complexity.
SESSION 8

2

Mar

SESSION 8

Python

Python

Sun 10:30 AM - 12:00 PM UTCMar 2, 10:30 AM - 12:00 PM UTC

In this session, we will go over dynamic programming, specifically memoization, to optimize recursive methods.
SESSION 9

8

Mar

SESSION 9

Python

Python

Sat 10:30 AM - 12:00 PM UTCMar 8, 10:30 AM - 12:00 PM UTC

In this session we will go over a strategy of Dynamic programming called memoization.
SESSION 10

9

Mar

SESSION 10

Python

Python

Sun 9:30 AM - 11:00 AM UTCMar 9, 9:30 AM - 11:00 AM UTC

In this session, we will go further into dynamic programming with a strategy called tabulation.
SESSION 11

16

Mar

SESSION 11

Python

Python

Sun 9:30 AM - 11:00 AM UTCMar 16, 9:30 AM - 11:00 AM UTC

In this session, we will go over graphs and graph algorithms such as DFS(hint backtracking) and BFS to find the shortest path to the key node.
SESSION 12

30

Mar

SESSION 12

Python

Python

Sun 9:30 AM - 11:00 AM UTCMar 30, 9:30 AM - 11:00 AM UTC

In this final session of this series, we will go over Dijkstra's algorithm to find the shortest path in a weighted graph.

Public Discussion

Please log in to see discussion on this series.

Jan 12 - Mar 30

12 weeks

60 - 90 mins

/ session

SCHEDULE

Sundays

10:30AM