Algorithm · Amazon · Hard
You are given a rectangular grid of characters with m rows and n columns, where every cell contains a lowercase English letter ('a' through 'z'). You are also given a list of strings words. Your task is to find every word from the list that can be constructed on the board by traversing a path through adjacent cells. A valid path moves from one cell to another that shares a side (up, down, left, or right). Each cell may be visited at most once during the construction of a…