Usaco Crash Course Graph Representations

Graphs

Time to learn your first algorithm!!! Now that we have

Today we look at depth-first search (DFS), where we traverse as far away from the starting node as possible and backtrack.

Time to look at dynamic programming (DP), a super powerful programming strategy that can solve a variety of problems. I use it in ...

Here are some of the more advanced features of C++ that can be used to make your code a lot cleaner :) (typedefs, bits/stdc++.h, ...

Learn how to implement

Segment trees are a super important Gold and Platinum algorithm that help with answer queries and updates on ranges. It's one ...

All JomaClass videos from 2020 are now free to watch. If you enjoy please consider donating here: https://support.joma.io/ This ...

Graph

Here's a quick

I go over ALL the Java syntax and classes that are relevant to

We learned about traversing

Today we're going to start our two-part unit on data visualization. Up to this point we've discussed raw data - which are just ...

USACO

Jenny's lectures Placement Oriented DSA with Java

Learn how to use the

When it comes to the language department for

Time to talk about epic Minimum Spanning Trees (MST) and an algorithm used to find them (Prim's algorithm)!!! Prim's is a pretty ...