Word Search - Leetcode 79 || Leetcode Medium || String || Matrix || DFS || Backtracking

Problem Name: 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.

Time complexity: O(M * N * 4^L).
Space complexity: O(L).
Where:
M is the number of rows in the board.
N is the number of columns in the board.
L is the length of the word.

#dailychallenge #coding #leetcode #dfs #strings #backtracking #algorithm #algo #programming #matrix

[sayandutta]

word search in now trending! very good explanation bro👍👍