Question

Complete code and answer question in comments:
Package hw4;
import java.util.ArrayList;

public class WordGame {
        /*
         * Returns all strings that appear
         * as a consecutive horizontal or vertical sequence of letters
         * (left-right, right-left, up-down, or down-up)
         * in the array board and also appear in dict.
         * Note that the same word may appear multiple times
         * on the board, and will then be multiple times in 
         * the returned array.
         * 
         * dict is assumed to be in alphabetical order
         * board is assumed to be rectangular
         */
        public static String[] search(String[] dict, char[][] board) {
                /*The following line contains <String>, this means
                 * that the ret is an ArrayList that contains String. It is an 
                 * ArrayList of only Strings. 
                 */
                ArrayList<String> ret = new ArrayList<String>();
                int height = board.length;
                
                // Set width to 0 for an empty board,
                // and to the width for first line otherwise,
                // because we assume the board is a rectangle
                int width = board.length==0 ? 0 : board[0].length;
                
                // TODO Generate substrings of the board
                // and check if they are in the dictionary
                // by calling inDictionary (which you implement).
                // If they are, use ret.add to add them
                // to the array that gets returned.
                // Character.toString, String+char, and String+=char
                // can all be useful here.
                // You may want to see https://docs.oracle.com/javase/8/docs/api/java/lang/String.html
        // and https://docs.oracle.com/javase/8/docs/api/java/lang/Character.html
                //
                // TODO (10% of your grade): if your board
                // has height h and width w, how many strings
                // do you need to check using inDictionary
                // (assume that you do nothing to filter out
                // duplicates or, equivalently, that the board
                // is such that there are no duplicates)
                // ANSWER: 
                // EXPLANATION OF THE ANSWER:

                // This line converts ArrayList<String> to String []
                return ret.toArray(new String[0]);
        }
}

Answer 1

Salution impert dava uiArray List Public class woxdthame mt hight bend Length Saing sa Chasactes . to Sting (bod ) or one -letre coos vet add s) to the nighr- -vouo dloesnt change İ 톨しHUO410 . İn Dictionary (dict. S ) ) Sis in the alictiopivu Check if set.add US) schasactes to String (boandl v)] ) o: check to the Left H4o in Dictionary lats) set adol (s)

et adol s) γ do es change cohen gou check cipandda / cheekincup HM34 o.in Dictionary (eict, s)) HLO e add US) "( his dine Convents A38au List 〈 Stainc S to Staing