Word Search (Popular) Problem

Word Search (Popular) Problem — ExecCode Medium DSA Practice

Solve the Word Search (Popular) problem on ExecCode. Free online medium DSA practice in Arrays - Basics. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Word Search (Popular). DFS with visited restore. For Word Search (Popular), focus on the exact input variables, return only the requested value, and preserve the required time complexity for the intended pattern.

Examples

Input {"board": [["A", "B"], ["C", "D"]], "word": "ABD"}; Output true. Input {"board": [["1"], ["0"], ["0"], ["0"]], "word": "R_e#b"}; Output false. Input {"board": [["1", "0", "1", "0"], ["1", "1", "0", "0"], ["1", "0", "1", "1"], ["0", "1", "1", "0"]], "word": "0L0122"}; Output false

Constraints

1 ≤ n ≤ 10^5

Practice Word Search (Popular) free on ExecCode. Browse DSA problems, topic map, and placement guides.