Determine Whether a Word Exists in a Character Grid
Company: Uber
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: hard
Interview Round: Technical Screen
Given a 2D character grid and a word, return whether the word can be formed by moving horizontally or vertically between adjacent cells without reusing a cell.
Implement:
```python
def exists_in_grid(board: list[list[str]], word: str) -> bool:
pass
```
Quick Answer: Practice a Uber coding interview problem focused on determine whether a word exists in a character grid. The prompt emphasizes edge cases, clean implementation, and verifiable test behavior without revealing the solution.
Return whether a word exists by walking adjacent cells without reuse.
Examples
Input: {"board":[["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]],"word":"ABCCED"}
Expected Output: true
Explanation: Exists.
Input: {"board":[["A","B"],["C","D"]],"word":"ABCD"}
Expected Output: false
Explanation: Cannot jump.