Solve real algorithmic challenges.

func solve(n int) int { dp := make([]int, n+1) dp[0], dp[1] = 0, 1 for i := 2; i <= n; i++ { dp[i] = dp[i-1]+dp[i-2] } return dp[n] } class Graph: def __init__(self): self.adj = {} def bfs(self, start): visited = set([start]) queue = [start] def shortest_path(grid): dist = [[inf]*cols for _ in range(rows)]