Nvidia SWE Interview Question 2023 December | Backtracking and Two Pointers | on-campus

Question 1: 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. Constraints m == board.length, n == board[i].length 1 <= m, n <= 6 1 <= word.length <= 15 board and word consist of ...