1. Homework review
2. Leetcode exercise - Pascal's triangle
3. Depth first search
b. More references @ https://usaco.guide/gold/bfs?lang=cpp
4. Leetcode exercise - Grids
Homework - Create a program to run BFS on a grid maze. BFS uses queues instead of recursion to ensure all nodes the same distance away are evaluated at the same time, so it will always give the shortest path.