Finding total amount of paths in a triangle grid (iterative without recursion)
Finding total amount of paths in a triangle grid (iterative without recursion) Question: i have a given a triangle grid: Triangle For every point (i,j) with i+j being even: Given recursive function Now i need to write a iterative function that finds all possible paths from (0,0) to the point (2n,0) given that n ∈ …