Pathing Solve Euler based problems for finding paths through various objects Algorithm Time compelxity: O(n) Average time: 0.04ms example Official Time complexity O(n²)