Word Grid Search

You are given an m x n grid of lowercase letters and a list of words. Write a function that returns all words from the list that can be found in the grid following these rules:

1. A word can be constructed from letters of sequentially adjacent cells. Adjacent cells include horizontal, vertical, and diagonal neighbors.
2. The same cell may not be used more than once in constructing a single word.
3. Words can be found in any direction (all eight possible directions).

Your function should have the following signature (or similar, depending on your programming language):

function findWords(grid: List[List[char]], words: List[string]) -> List[string]

The input parameters are:

• grid: a 2D array of characters representing the letter grid.
• words: a list of words to search for in the grid.

Your output should be an array (or list) containing all the words that can be found in the grid.

Consider efficiency in your implementation, as both the grid and the list of words can be large. Avoid unnecessary computations and strive for a solution that scales well with input size.

Good luck!