Word search in grid
Given a grid of characters and a word, return True if the word can be formed by a path of orthogonally adjacent cells, where each cell is used at most once per path. The grid has at most 5 rows and 5 columns. Return a boolean.
Implement
word_search(board: list[list[str]], word: str) → boolExamples
in
[[["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]],"ABCCED"]outtrueWhat a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[[["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]],"ABCCED"]truenot run yetsample