Skip to content

problem8.md

Latest commit

 

History

History
16 lines (12 loc) · 613 Bytes

problem8.md

File metadata and controls

16 lines (12 loc) · 613 Bytes

Problem 8: The Word Forger (Word Search)

Problem Statement

Given an m x n grid of characters board and a string word, return true if word exists in the grid. The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once.

Input Format

  • A 2D character grid board.
  • A string word.

Constraints

  • 1 <= m, n <= 6
  • 1 <= word.length <= 15

Example

Input: board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCCED"
Output: True