Word Search
Advanced Backtracking DSA practice problem on Onlearn.
Difficulty: medium.
Topics: Given an m x n grid of characters (board) and a string (word), return true if the word can be constructed from letters of sequentially adjacent cells (horizontally or vertically neighboring), where the same letter cell may not be used more than once., Backtracking, Matrices, Recursion, Two-dimensional Array Traversal, visited tracking, backtracking, grid traversal, matrix operations, recursion, Matrix Traversal, Backtracking Constraints, Grid as a Graph, Matrix Manipulation.
Given an m x n grid of characters board and a string word, return true if the 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: Explanation: We can easily find the given word in the matrix. Example 2: Explanation: There is no such word in the given matrix.