[CSES][Introductory Problems] Grid Paths

https://cses.fi/problemset/task/1625 In this problem we need to find the number of valid paths from the upper left corner to the lower left corner in a 7x7 grid using move UP, DOWN, RIGHT, and LEFT. We prune the search space by removing branches that create multiple components of unvisited cells.