Data Structures and Algorithms

Benefits of Peer Tutoring

Why get tutored by other students?

About Certifications

Prove your mastery and get ready to tutor.

Become a Tutor

Learn, grow, and give back through tutoring.

Session Safety Measures

How we keep virtual tutoring safe.

Help Desk

Have questions? Search our FAQ.

Community Events

Game nights, product updates, and more.

Study Spaces

Stay motivated in virtual study rooms.

Leaderboards

Check out the community's impact.

Stories

Testimonials from the Schoolhouse community.

Blog

Keep up with our volunteer-run blog.

Data Structures and Algorithms

SAT Score Range

•

12 sessions

•

🔥 9 spots left!

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

Upcoming

All

✋ 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 2

18

Jan

SESSION 2

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

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

26

Jan

SESSION 4

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 5

2

Feb

SESSION 5

Python

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

In this session, we will be going over quicksort and it's applications with time complexity in mind.

SESSION 6

9

Feb

SESSION 6

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

16

Feb

SESSION 7

Python

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

In this session, we will go over binary search vs linear search and its time complexity.

SESSION 8

23

Feb

SESSION 8

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 9

2

Mar

SESSION 9

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 10

9

Mar

SESSION 10

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

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

23

Mar

SESSION 12

Python

Sun 9:30 AM - 11:00 AM UTCMar 23, 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 23

11 weeks

60 - 90 mins

/ session

Next session on January 18, 2025

SCHEDULE

Sundays

10:30AM