lp05 : Leetcode practice with graph search - bfs and dfs

num	ready?	description	assigned	due
lp05	false	Leetcode practice with graph search - bfs and dfs	Fri 02/27 09:00AM	Fri 03/13 11:59PM

Additional Practice Problems

Topics covered: Weeks 8-9 (Graph representation, BFS, DFS, graph algorithms)

Complete at least 2 problems from this set and submit via Gradescope by the due date.

1. Find if path exists (easy) https://leetcode.com/problems/find-if-path-exists-in-graph/description/
2. Keys and Rooms (medium) https://leetcode.com/problems/keys-and-rooms/description/
3. Rotting Oranges (medium) https://leetcode.com/problems/rotting-oranges/description/
4. Max number of fish (medium) https://leetcode.com/problems/maximum-number-of-fish-in-a-grid/description/
5. LCA in a binary tree (medium) https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/

Optional challenge (not included on exams):

1. Minimum Operations to convert number (medium) https://leetcode.com/problems/minimum-operations-to-convert-number/description/ Although this is a good problem, there is a constraint that is somewhat obscure, which is that when viewing the problem as a graph, all node values except for the goal must be between 0 and 3000, and this constraint is used to figure out which paths through the graph from start to goal and invalid.