#Backtracking

Given a 2D grid of characters and a target string, determine whether the string can be constructed from adjacent cells moving in four possible directions (up, down, left, right). Each cell can only be used once in the path.

Given a grid representing a unique paths problem, provide a brute force solution as well as an optimal one. You need to explain the time complexity of both solutions.