Word search on board
Given an m x n board of lowercase letters and a single target word, return true if the word can be formed by a path of 4-directionally adjacent cells where each cell is used at most once. The path may start at any cell. The word is non-empty. The board has at least one cell.
Implement
word_exists(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 40 min
solution.py
InputExpectedGot
[[["a","b","c","e"],["s","f","c","s"],["a","d","e","e"]],"abcced"]truenot run yetsample