Given an N*N grid, find a path from the bottom row to the top row that maximizes the sum of values. You can move from (r, c) to (r-1, c-1), (r-1, c), or (r-1, c+1).
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.