From f7d8991f8f3d13f31b5039bec8d042fb9fae1aaf Mon Sep 17 00:00:00 2001 From: Deven <63876261+devenperez@users.noreply.github.com> Date: Thu, 2 Oct 2025 12:51:31 -0400 Subject: [PATCH] Create README - LeetHub --- 0079-word-search/README.md | 39 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 0079-word-search/README.md diff --git a/0079-word-search/README.md b/0079-word-search/README.md new file mode 100644 index 0000000..32a6aaf --- /dev/null +++ b/0079-word-search/README.md @@ -0,0 +1,39 @@ +

79. Word Search

Medium

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.

+ +

 

+

Example 1:

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

Example 2:

+ +
+Input: board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "SEE"
+Output: true
+
+ +

Example 3:

+ +
+Input: board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCB"
+Output: false
+
+ +

 

+

Constraints:

+ + + +

 

+

Follow up: Could you use search pruning to make your solution faster with a larger board?