DevHireLab
TutorialsBootcamp
ProblemsCode SimulatorAI InterviewSoonContact
DevHireLab
TutorialsBootcamp
ProblemsCode SimulatorAI InterviewSoonContact
Back to Arena
medium
Backtracking

Word Search

**Problem Statement:** Given the required input arguments, write an efficient algorithm to solve the **Word Search** problem. Implement the required logic as specified by standard definitions for this classic algorithmic challenge. **Hint / Expected Approach:** DFS with in-place visited marking, backtrack **Edge Cases to Consider:** - (1) Word longer than grid cells - (2) Single cell grid - (3) Same character repeated in word

Examples

Example 1
Input: [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], "ABCCED"
Output: true
Explanation: Classic
Example 2
Input: [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], "SEE"
Output: true
Example 3
Input: [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], "ABCB"
Output: false
Explanation: Can't reuse B

Constraints

  • ▪Input arguments are within valid ranges
  • ▪Optimize for execution speed
  • ▪Handle null/empty inputs gracefully

Watch Out For Edge Cases

  • ▪Word longer than grid cells
  • ▪Single cell grid
  • ▪Same character repeated in word
Frequently Asked At
AmazonGoogleMicrosoftMetaAdobeTCS