CLASS OUTLINE1. Homework review2. Leetcode exercise - Pascal's triangle a. https://leetcode.com/problems/pascals-triangle/ 3. Depth first search a. https://replit.com/@paracorde/PromotedScaredAddition#main.py b. More references @ https://usaco.guide/gold/bfs?lang=cpp 4. Leetcode exercise - Grids a. https://leetcode.com/problems/minimum-path-cost-in-a-grid/ 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.