Skip to content

problem6.md

Latest commit

 

History

History
13 lines (10 loc) · 561 Bytes

problem6.md

File metadata and controls

13 lines (10 loc) · 561 Bytes

Problem 6: Lexical Pathfinding (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 matrix board.
  • A string word.

Example

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