You are given a String[] grid representing a rectangular grid of letters. You are also given a String find, a word you are to find within the grid. The starting point may be anywhere in the grid. The path may move up, down, left, right, or diagonally from one letter to the next, and may use letters in the grid more than once, but you may not stay on the same cell twice in a row (see example 6 for clarification).

You are to return an int indicating the number of ways find can be found within the grid. If the result is more than 1,000,000,000, return -1.

Definition-You are given a String [] grid representing a rectangular grid of letters. You are also give n find a String. a word you are to find within the grid. The starti ng point may be anywhere in the grid. The path may move up, down, left, right, or diagonally from one letter to the next, and may use letters in the grid more than once. but you may not stay on the same cell twice in a row (see example for clarification 6). You are to re turn an int indicating the number of ways find ca n be found within the grid. If the result is more t han 1,000,000,000, return -1. Definition