Problem specification: In this assignment, you will search for a word in square sized grid of...

Transcribed Image Text:

Problem specification: In this assignment, you will search for a word in square sized grid of letters. You will write a Java program that reads a grid of letters and a specified word from the user, counts how many times the word appeared in the grid in horizontal orientation (from left to right or from right to left), vertical orientation (from top to bottom or from bottom to top) or diagonal orientation (from upper left to lower right, from lower right to upper left, from upper right to lower left or from lower left to upper right) and prints the total count. An example is shown here where the grid size is 7X7 and you can find the word CAT in all possible orientations. Your program should print how many times in total the specified word appeared in the grid in any of these orientations. Input specification: The input starts with an integer N which represents the grid size (NXN). Next, N lines will follow where each line represents a row of letters. Each line will have exactly N letters in them. The last line is the word you have to search in the grid. The number of characters in the last line does not exceed N. You can assume that the value of N will not exceed 10000. Sample input: 4 WORD OODW RDRO Output specification: The output of your program is a single integer that represents the number of times the word is found in the grid. Note: You must not print anything extraneous (such as "Please enter N" or "the result is"). DWOD WORD 3 ABA BAB ABA AB C TGOC FX AVAATAC Sample output: 3 TUTCZ PM GDCEST B OHQAATL DNXCTAK Y CATRC J 12 Problem specification: In this assignment, you will search for a word in square sized grid of letters. You will write a Java program that reads a grid of letters and a specified word from the user, counts how many times the word appeared in the grid in horizontal orientation (from left to right or from right to left), vertical orientation (from top to bottom or from bottom to top) or diagonal orientation (from upper left to lower right, from lower right to upper left, from upper right to lower left or from lower left to upper right) and prints the total count. An example is shown here where the grid size is 7X7 and you can find the word CAT in all possible orientations. Your program should print how many times in total the specified word appeared in the grid in any of these orientations. Input specification: The input starts with an integer N which represents the grid size (NXN). Next, N lines will follow where each line represents a row of letters. Each line will have exactly N letters in them. The last line is the word you have to search in the grid. The number of characters in the last line does not exceed N. You can assume that the value of N will not exceed 10000. Sample input: 4 WORD OODW RDRO Output specification: The output of your program is a single integer that represents the number of times the word is found in the grid. Note: You must not print anything extraneous (such as "Please enter N" or "the result is"). DWOD WORD 3 ABA BAB ABA AB C TGOC FX AVAATAC Sample output: 3 TUTCZ PM GDCEST B OHQAATL DNXCTAK Y CATRC J 12

Answer rating: 100% (QA)

import javautilScanner public class Puzzle public static void mainString args Scanner scan new Scann... View the full answer